TSTP Solution File: CSR123^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR123^2 : TPTP v8.2.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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:33 EDT 2024
% Result : Theorem 0.17s 0.47s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 28 ( 8 unt; 7 typ; 0 def)
% Number of atoms : 52 ( 1 equ; 0 cnn)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 194 ( 33 ~; 22 |; 11 &; 128 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 19 ( 19 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 24 ( 0 ^ 18 !; 6 ?; 24 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_37,type,
holdsDuring_THFTYPE_IiooI: $i > $o > $o ).
thf(decl_49,type,
lBen_THFTYPE_i: $i ).
thf(decl_50,type,
lBill_THFTYPE_i: $i ).
thf(decl_73,type,
lSue_THFTYPE_i: $i ).
thf(decl_84,type,
lYearFn_THFTYPE_IiiI: $i > $i ).
thf(decl_88,type,
likes_THFTYPE_IiioI: $i > $i > $o ).
thf(decl_94,type,
n2009_THFTYPE_i: $i ).
thf(con,conjecture,
? [X44: $i > $i > $o,X5: $i,X6: $i] :
( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ( ( X44 @ lSue_THFTYPE_i @ X5 )
& ~ ( X44 @ lSue_THFTYPE_i @ X6 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
thf(ax_031,axiom,
( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBen_THFTYPE_i ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_031) ).
thf(ax_048,axiom,
likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_048) ).
thf(c_0_3,negated_conjecture,
~ ? [X44: $i > $i > $o,X5: $i,X6: $i] :
( ( ~ ( ( X44 @ lSue_THFTYPE_i @ X5 )
& ~ ( X44 @ lSue_THFTYPE_i @ X6 ) )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( ( X44 @ lSue_THFTYPE_i @ X5 )
& ~ ( X44 @ lSue_THFTYPE_i @ X6 ) )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fool_unroll,[status(thm)],[inference(assume_negation,[status(cth)],[con])]) ).
thf(c_0_4,plain,
( ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBen_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBen_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[ax_031])]) ).
thf(c_0_5,negated_conjecture,
! [X143: $i > $i > $o,X144: $i,X145: $i] :
( ( ~ ( X143 @ lSue_THFTYPE_i @ X144 )
| ( X143 @ lSue_THFTYPE_i @ X145 )
| ( X143 @ lSue_THFTYPE_i @ X144 ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ( X143 @ lSue_THFTYPE_i @ X144 ) )
& ( ~ ( X143 @ lSue_THFTYPE_i @ X144 )
| ( X143 @ lSue_THFTYPE_i @ X145 )
| ~ ( X143 @ lSue_THFTYPE_i @ X145 ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ~ ( X143 @ lSue_THFTYPE_i @ X145 ) )
& ( ~ ( X143 @ lSue_THFTYPE_i @ X144 )
| ( X143 @ lSue_THFTYPE_i @ X145 )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
thf(c_0_6,plain,
( ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBen_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBen_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_nnf,[status(thm)],[c_0_4]) ).
thf(c_0_7,negated_conjecture,
! [X16: $i > $i > $o,X1: $i] :
( ( X16 @ lSue_THFTYPE_i @ X1 )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_8,negated_conjecture,
! [X16: $i > $i > $o,X1: $i] :
( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true )
| ~ ( X16 @ lSue_THFTYPE_i @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_9,plain,
( ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true )
| ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBen_THFTYPE_i ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_10,negated_conjecture,
~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ),
inference(csr,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_11,plain,
( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBen_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_12,plain,
~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBen_THFTYPE_i ),
inference(sr,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_13,negated_conjecture,
! [X16: $i > $i > $o,X2: $i,X1: $i] :
( ( X16 @ lSue_THFTYPE_i @ X2 )
| ~ ( X16 @ lSue_THFTYPE_i @ X1 )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_14,plain,
holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true,
inference(sr,[status(thm)],[c_0_11,c_0_12]) ).
thf(c_0_15,negated_conjecture,
! [X1: $i,X16: $i > $i > $o,X2: $i] :
( ( X16 @ lSue_THFTYPE_i @ X1 )
| ~ ( X16 @ lSue_THFTYPE_i @ X2 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]) ).
thf(c_0_16,negated_conjecture,
! [X1: $i,X2: $i] : ( X1 = X2 ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_15]) ).
thf(c_0_17,negated_conjecture,
! [X1: $i] :
~ ( likes_THFTYPE_IiioI @ X1 @ lBen_THFTYPE_i ),
inference(spm,[status(thm)],[c_0_12,c_0_16]) ).
thf(c_0_18,plain,
likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i,
inference(split_conjunct,[status(thm)],[ax_048]) ).
thf(c_0_19,negated_conjecture,
! [X1: $i,X2: $i] :
~ ( likes_THFTYPE_IiioI @ X1 @ X2 ),
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
thf(c_0_20,plain,
$false,
inference(sr,[status(thm)],[c_0_18,c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : CSR123^2 : TPTP v8.2.0. Released v4.1.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n014.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Sun May 19 01:14:07 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running higher-order theorem proving
% 0.17/0.44 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.17/0.47 # Version: 3.1.0-ho
% 0.17/0.47 # Preprocessing class: HSLSSMSMSSSNHSA.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting new_ho_10 with 1500s (5) cores
% 0.17/0.47 # Starting new_ho_10_cnf2 with 300s (1) cores
% 0.17/0.47 # Starting lpo9_lambda_fix with 300s (1) cores
% 0.17/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.47 # lpo9_lambda_fix with pid 29735 completed with status 0
% 0.17/0.47 # Result found by lpo9_lambda_fix
% 0.17/0.47 # Preprocessing class: HSLSSMSMSSSNHSA.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting new_ho_10 with 1500s (5) cores
% 0.17/0.47 # Starting new_ho_10_cnf2 with 300s (1) cores
% 0.17/0.47 # Starting lpo9_lambda_fix with 300s (1) cores
% 0.17/0.47 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.17/0.47 # Search class: HGHSF-FFMM21-SHSFFFBN
% 0.17/0.47 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.47 # Starting ho_unfolding_3 with 163s (1) cores
% 0.17/0.47 # ho_unfolding_3 with pid 29738 completed with status 0
% 0.17/0.47 # Result found by ho_unfolding_3
% 0.17/0.47 # Preprocessing class: HSLSSMSMSSSNHSA.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting new_ho_10 with 1500s (5) cores
% 0.17/0.47 # Starting new_ho_10_cnf2 with 300s (1) cores
% 0.17/0.47 # Starting lpo9_lambda_fix with 300s (1) cores
% 0.17/0.47 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.17/0.47 # Search class: HGHSF-FFMM21-SHSFFFBN
% 0.17/0.47 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.47 # Starting ho_unfolding_3 with 163s (1) cores
% 0.17/0.47 # Preprocessing time : 0.003 s
% 0.17/0.47 # Presaturation interreduction done
% 0.17/0.47
% 0.17/0.47 # Proof found!
% 0.17/0.47 # SZS status Theorem
% 0.17/0.47 # SZS output start CNFRefutation
% See solution above
% 0.17/0.47 # Parsed axioms : 282
% 0.17/0.47 # Removed by relevancy pruning/SinE : 97
% 0.17/0.47 # Initial clauses : 204
% 0.17/0.47 # Removed in clause preprocessing : 7
% 0.17/0.47 # Initial clauses in saturation : 197
% 0.17/0.47 # Processed clauses : 307
% 0.17/0.47 # ...of these trivial : 2
% 0.17/0.47 # ...subsumed : 3
% 0.17/0.47 # ...remaining for further processing : 302
% 0.17/0.47 # Other redundant clauses eliminated : 0
% 0.17/0.47 # Clauses deleted for lack of memory : 0
% 0.17/0.47 # Backward-subsumed : 6
% 0.17/0.47 # Backward-rewritten : 0
% 0.17/0.47 # Generated clauses : 339
% 0.17/0.47 # ...of the previous two non-redundant : 333
% 0.17/0.47 # ...aggressively subsumed : 0
% 0.17/0.47 # Contextual simplify-reflections : 1
% 0.17/0.47 # Paramodulations : 331
% 0.17/0.47 # Factorizations : 0
% 0.17/0.47 # NegExts : 0
% 0.17/0.47 # Equation resolutions : 0
% 0.17/0.47 # Disequality decompositions : 0
% 0.17/0.47 # Total rewrite steps : 3
% 0.17/0.47 # ...of those cached : 0
% 0.17/0.47 # Propositional unsat checks : 0
% 0.17/0.47 # Propositional check models : 0
% 0.17/0.47 # Propositional check unsatisfiable : 0
% 0.17/0.47 # Propositional clauses : 0
% 0.17/0.47 # Propositional clauses after purity: 0
% 0.17/0.47 # Propositional unsat core size : 0
% 0.17/0.47 # Propositional preprocessing time : 0.000
% 0.17/0.47 # Propositional encoding time : 0.000
% 0.17/0.47 # Propositional solver time : 0.000
% 0.17/0.47 # Success case prop preproc time : 0.000
% 0.17/0.47 # Success case prop encoding time : 0.000
% 0.17/0.47 # Success case prop solver time : 0.000
% 0.17/0.47 # Current number of processed clauses : 104
% 0.17/0.47 # Positive orientable unit clauses : 98
% 0.17/0.47 # Positive unorientable unit clauses: 1
% 0.17/0.47 # Negative unit clauses : 3
% 0.17/0.47 # Non-unit-clauses : 2
% 0.17/0.47 # Current number of unprocessed clauses: 413
% 0.17/0.47 # ...number of literals in the above : 482
% 0.17/0.47 # Current number of archived formulas : 0
% 0.17/0.47 # Current number of archived clauses : 198
% 0.17/0.47 # Clause-clause subsumption calls (NU) : 345
% 0.17/0.47 # Rec. Clause-clause subsumption calls : 186
% 0.17/0.47 # Non-unit clause-clause subsumptions : 6
% 0.17/0.47 # Unit Clause-clause subsumption calls : 126
% 0.17/0.47 # Rewrite failures with RHS unbound : 0
% 0.17/0.47 # BW rewrite match attempts : 346
% 0.17/0.47 # BW rewrite match successes : 80
% 0.17/0.47 # Condensation attempts : 310
% 0.17/0.47 # Condensation successes : 1
% 0.17/0.47 # Termbank termtop insertions : 10162
% 0.17/0.47 # Search garbage collected termcells : 1406
% 0.17/0.47
% 0.17/0.47 # -------------------------------------------------
% 0.17/0.47 # User time : 0.022 s
% 0.17/0.47 # System time : 0.003 s
% 0.17/0.47 # Total time : 0.025 s
% 0.17/0.47 # Maximum resident set size: 2500 pages
% 0.17/0.47
% 0.17/0.47 # -------------------------------------------------
% 0.17/0.47 # User time : 0.028 s
% 0.17/0.47 # System time : 0.005 s
% 0.17/0.47 # Total time : 0.033 s
% 0.17/0.47 # Maximum resident set size: 1920 pages
% 0.17/0.47 % E---3.1 exiting
% 0.17/0.47 % E exiting
%------------------------------------------------------------------------------