TSTP Solution File: CSR152^3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR152^3 : TPTP v8.2.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon May 20 19:16:47 EDT 2024
% Result : Theorem 0.44s 1.05s
% Output : CNFRefutation 0.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of formulae : 27 ( 4 unt; 7 typ; 0 def)
% Number of atoms : 79 ( 6 equ; 0 cnn)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 159 ( 25 ~; 22 |; 9 &; 100 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 7 con; 0-2 aty)
% Number of variables : 6 ( 0 ^ 6 !; 0 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_229,type,
knows_THFTYPE_IiooI: $i > $o > $o ).
thf(decl_1451,type,
lBill_THFTYPE_i: $i ).
thf(decl_1452,type,
lChris_THFTYPE_i: $i ).
thf(decl_1453,type,
lMary_THFTYPE_i: $i ).
thf(decl_1454,type,
lSue_THFTYPE_i: $i ).
thf(decl_1455,type,
likes_THFTYPE_IiioI: $i > $i > $o ).
thf(decl_1469,type,
esk2_0: $i ).
thf(ax,axiom,
knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ ( lChris_THFTYPE_i = lChris_THFTYPE_i ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax) ).
thf(con,conjecture,
knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
thf(ax_002,axiom,
( knows_THFTYPE_IiooI @ lChris_THFTYPE_i
@ ! [X339: $i] :
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X339 )
=> ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X339 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_002) ).
thf(ax_001,axiom,
likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_001) ).
thf(c_0_4,axiom,
( ( ( lChris_THFTYPE_i != lChris_THFTYPE_i )
| ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $true ) )
& ( ( lChris_THFTYPE_i = lChris_THFTYPE_i )
| ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $false ) ) ),
inference(fool_unroll,[status(thm)],[ax]) ).
thf(c_0_5,negated_conjecture,
~ ( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $true ) )
& ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $false ) ) ),
inference(fool_unroll,[status(thm)],[inference(assume_negation,[status(cth)],[con])]) ).
thf(c_0_6,plain,
( ( ( lChris_THFTYPE_i != lChris_THFTYPE_i )
| ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $true ) )
& ( ( lChris_THFTYPE_i = lChris_THFTYPE_i )
| ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $false ) ) ),
inference(fof_nnf,[status(thm)],[c_0_4]) ).
thf(c_0_7,axiom,
( ( ~ ! [X339: $i] :
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X339 )
=> ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X339 ) )
| ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $true ) )
& ( ! [X339: $i] :
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X339 )
=> ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X339 ) )
| ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $false ) ) ),
inference(fool_unroll,[status(thm)],[ax_002]) ).
thf(c_0_8,negated_conjecture,
( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) )
& ( ~ ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $false )
| ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) )
& ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $true ) )
& ( ~ ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $false )
| ~ ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $true ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
thf(c_0_9,plain,
( ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $true )
| ( lChris_THFTYPE_i != lChris_THFTYPE_i ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_10,plain,
! [X3082: $i] :
( ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ esk2_0 )
| ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $true ) )
& ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ esk2_0 )
| ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $true ) )
& ( ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X3082 )
| ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X3082 )
| ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $false ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])])]) ).
thf(c_0_11,negated_conjecture,
( ~ ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ ~ $true )
| ~ ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_12,plain,
knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $true,
inference(cn,[status(thm)],[c_0_9]) ).
thf(c_0_13,plain,
! [X1: $i] :
( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 )
| ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ ~ $true )
| ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_14,negated_conjecture,
~ ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ ~ $true ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12])]) ).
thf(c_0_15,negated_conjecture,
( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_16,plain,
! [X1: $i] :
( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 )
| ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 ) ),
inference(sr,[status(thm)],[c_0_13,c_0_14]) ).
thf(c_0_17,negated_conjecture,
~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_12])]) ).
thf(c_0_18,plain,
likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i,
inference(split_conjunct,[status(thm)],[ax_001]) ).
thf(c_0_19,plain,
$false,
inference(cdclpropres,[status(thm)],[c_0_16,c_0_17,c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CSR152^3 : TPTP v8.2.0. Released v5.3.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n009.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 01:34:38 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running higher-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.44/1.05 # Version: 3.1.0-ho
% 0.44/1.05 # Preprocessing class: HMLLSMSLSSMCHFA.
% 0.44/1.05 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.44/1.05 # Starting new_ho_10 with 1500s (5) cores
% 0.44/1.05 # Starting sh5l with 300s (1) cores
% 0.44/1.05 # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.44/1.05 # Starting lpo1_def_fix with 300s (1) cores
% 0.44/1.05 # new_ho_10 with pid 25428 completed with status 0
% 0.44/1.05 # Result found by new_ho_10
% 0.44/1.05 # Preprocessing class: HMLLSMSLSSMCHFA.
% 0.44/1.05 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.44/1.05 # Starting new_ho_10 with 1500s (5) cores
% 0.44/1.05 # SinE strategy is gf600_h_gu_R05_F100_L20000
% 0.44/1.05 # Search class: HGHSM-SMLM31-MHFFFFBN
% 0.44/1.05 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.44/1.05 # Starting sh3 with 811s (1) cores
% 0.44/1.05 # Starting new_ho_10 with 151s (1) cores
% 0.44/1.05 # Starting new_ho_12 with 136s (1) cores
% 0.44/1.05 # Starting new_ho_9 with 136s (1) cores
% 0.44/1.05 # Starting sh7 with 136s (1) cores
% 0.44/1.05 # new_ho_9 with pid 25437 completed with status 0
% 0.44/1.05 # Result found by new_ho_9
% 0.44/1.05 # Preprocessing class: HMLLSMSLSSMCHFA.
% 0.44/1.05 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.44/1.05 # Starting new_ho_10 with 1500s (5) cores
% 0.44/1.05 # SinE strategy is gf600_h_gu_R05_F100_L20000
% 0.44/1.05 # Search class: HGHSM-SMLM31-MHFFFFBN
% 0.44/1.05 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.44/1.05 # Starting sh3 with 811s (1) cores
% 0.44/1.05 # Starting new_ho_10 with 151s (1) cores
% 0.44/1.05 # Starting new_ho_12 with 136s (1) cores
% 0.44/1.05 # Starting new_ho_9 with 136s (1) cores
% 0.44/1.05 # Preprocessing time : 0.061 s
% 0.44/1.05 # SatCheck found unsatisfiable ground set
% 0.44/1.05 # Presaturation interreduction done
% 0.44/1.05
% 0.44/1.05 # Proof found!
% 0.44/1.05 # SZS status Theorem
% 0.44/1.05 # SZS output start CNFRefutation
% See solution above
% 0.44/1.05 # Parsed axioms : 5016
% 0.44/1.05 # Removed by relevancy pruning/SinE : 1762
% 0.44/1.05 # Initial clauses : 4669
% 0.44/1.05 # Removed in clause preprocessing : 263
% 0.44/1.05 # Initial clauses in saturation : 4406
% 0.44/1.05 # Processed clauses : 2524
% 0.44/1.05 # ...of these trivial : 4
% 0.44/1.05 # ...subsumed : 20
% 0.44/1.05 # ...remaining for further processing : 2500
% 0.44/1.05 # Other redundant clauses eliminated : 29
% 0.44/1.05 # Clauses deleted for lack of memory : 0
% 0.44/1.05 # Backward-subsumed : 0
% 0.44/1.05 # Backward-rewritten : 0
% 0.44/1.05 # Generated clauses : 32
% 0.44/1.05 # ...of the previous two non-redundant : 31
% 0.44/1.05 # ...aggressively subsumed : 0
% 0.44/1.05 # Contextual simplify-reflections : 0
% 0.44/1.05 # Paramodulations : 0
% 0.44/1.05 # Factorizations : 0
% 0.44/1.05 # NegExts : 0
% 0.44/1.05 # Equation resolutions : 29
% 0.44/1.05 # Disequality decompositions : 0
% 0.44/1.05 # Total rewrite steps : 7
% 0.44/1.05 # ...of those cached : 3
% 0.44/1.05 # Propositional unsat checks : 1
% 0.44/1.05 # Propositional check models : 0
% 0.44/1.05 # Propositional check unsatisfiable : 1
% 0.44/1.05 # Propositional clauses : 4383
% 0.44/1.05 # Propositional clauses after purity: 374
% 0.44/1.05 # Propositional unsat core size : 3
% 0.44/1.05 # Propositional preprocessing time : 0.000
% 0.44/1.05 # Propositional encoding time : 0.008
% 0.44/1.05 # Propositional solver time : 0.001
% 0.44/1.05 # Success case prop preproc time : 0.000
% 0.44/1.05 # Success case prop encoding time : 0.008
% 0.44/1.05 # Success case prop solver time : 0.001
% 0.44/1.05 # Current number of processed clauses : 2470
% 0.44/1.05 # Positive orientable unit clauses : 2161
% 0.44/1.05 # Positive unorientable unit clauses: 0
% 0.44/1.05 # Negative unit clauses : 4
% 0.44/1.05 # Non-unit-clauses : 305
% 0.44/1.05 # Current number of unprocessed clauses: 1913
% 0.44/1.05 # ...number of literals in the above : 6349
% 0.44/1.05 # Current number of archived formulas : 0
% 0.44/1.05 # Current number of archived clauses : 0
% 0.44/1.05 # Clause-clause subsumption calls (NU) : 21448
% 0.44/1.05 # Rec. Clause-clause subsumption calls : 14301
% 0.44/1.05 # Non-unit clause-clause subsumptions : 21
% 0.44/1.05 # Unit Clause-clause subsumption calls : 8883
% 0.44/1.05 # Rewrite failures with RHS unbound : 0
% 0.44/1.05 # BW rewrite match attempts : 0
% 0.44/1.05 # BW rewrite match successes : 0
% 0.44/1.05 # Condensation attempts : 2524
% 0.44/1.05 # Condensation successes : 2
% 0.44/1.05 # Termbank termtop insertions : 259350
% 0.44/1.05 # Search garbage collected termcells : 45928
% 0.44/1.05
% 0.44/1.05 # -------------------------------------------------
% 0.44/1.05 # User time : 0.363 s
% 0.44/1.05 # System time : 0.053 s
% 0.44/1.05 # Total time : 0.416 s
% 0.44/1.05 # Maximum resident set size: 17944 pages
% 0.44/1.05
% 0.44/1.05 # -------------------------------------------------
% 0.44/1.05 # User time : 0.960 s
% 0.44/1.05 # System time : 0.160 s
% 0.44/1.05 # Total time : 1.120 s
% 0.44/1.05 # Maximum resident set size: 5796 pages
% 0.44/1.05 % E---3.1 exiting
% 0.44/1.06 % E exiting
%------------------------------------------------------------------------------