TSTP Solution File: CSR127^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR127^2 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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 : Sat May 4 07:34:34 EDT 2024
% Result : Theorem 0.23s 0.55s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 26 ( 5 unt; 7 typ; 0 def)
% Number of atoms : 69 ( 0 equ; 0 cnn)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 169 ( 21 ~; 19 |; 7 &; 119 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 14 ( 0 ^ 12 !; 2 ?; 14 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_37,type,
holdsDuring_THFTYPE_IiooI: $i > $o > $o ).
thf(decl_49,type,
lBill_THFTYPE_i: $i ).
thf(decl_60,type,
lMary_THFTYPE_i: $i ).
thf(decl_72,type,
lSue_THFTYPE_i: $i ).
thf(decl_83,type,
lYearFn_THFTYPE_IiiI: $i > $i ).
thf(decl_87,type,
likes_THFTYPE_IiioI: $i > $i > $o ).
thf(decl_93,type,
n2009_THFTYPE_i: $i ).
thf(con,conjecture,
? [X6: $i] : ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( likes_THFTYPE_IiioI @ X6 @ lBill_THFTYPE_i ) ),
file('/export/starexec/sandbox/tmp/tmp.7I93yiH8Xz/E---3.1_17192.p',con) ).
thf(ax_005,axiom,
! [X5: $i] :
( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X5 )
=> ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X5 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.7I93yiH8Xz/E---3.1_17192.p',ax_005) ).
thf(ax_022,axiom,
likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i,
file('/export/starexec/sandbox/tmp/tmp.7I93yiH8Xz/E---3.1_17192.p',ax_022) ).
thf(c_0_3,negated_conjecture,
~ ? [X6: $i] :
( ( ~ ( likes_THFTYPE_IiioI @ X6 @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( likes_THFTYPE_IiioI @ X6 @ lBill_THFTYPE_i )
| ( 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,axiom,
! [X5: $i] :
( ( ~ ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X5 )
=> ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X5 ) )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X5 )
=> ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X5 ) )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fool_unroll,[status(thm)],[ax_005]) ).
thf(c_0_5,negated_conjecture,
! [X131: $i] :
( ( ~ ( likes_THFTYPE_IiioI @ X131 @ lBill_THFTYPE_i )
| ( likes_THFTYPE_IiioI @ X131 @ lBill_THFTYPE_i ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ( likes_THFTYPE_IiioI @ X131 @ lBill_THFTYPE_i ) )
& ( ~ ( likes_THFTYPE_IiioI @ X131 @ lBill_THFTYPE_i )
| ~ ( 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,
! [X137: $i] :
( ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X137 )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X137 )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X137 )
| ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X137 )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
thf(c_0_7,negated_conjecture,
! [X1: $i] :
( ~ ( likes_THFTYPE_IiioI @ X1 @ lBill_THFTYPE_i )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_8,plain,
likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i,
inference(split_conjunct,[status(thm)],[ax_022]) ).
thf(c_0_9,plain,
! [X1: $i] :
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ),
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(spm,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_11,plain,
! [X1: $i] :
( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true )
| ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_12,plain,
! [X1: $i] : ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 ),
inference(sr,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_13,plain,
! [X1: $i] :
( ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true )
| ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_14,plain,
! [X1: $i] :
( ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true )
| ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12])]) ).
thf(c_0_15,negated_conjecture,
! [X1: $i] :
( ( likes_THFTYPE_IiioI @ X1 @ lBill_THFTYPE_i )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_16,plain,
holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_10]) ).
thf(c_0_17,negated_conjecture,
! [X1: $i] : ( likes_THFTYPE_IiioI @ X1 @ lBill_THFTYPE_i ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]) ).
thf(c_0_18,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_17]),c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.14 % Problem : CSR127^2 : TPTP v8.1.2. Released v4.1.0.
% 0.10/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n023.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 15:20:38 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.23/0.51 Running higher-order theorem proving
% 0.23/0.51 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/tmp/tmp.7I93yiH8Xz/E---3.1_17192.p
% 0.23/0.55 # Version: 3.1.0-ho
% 0.23/0.55 # Preprocessing class: HSLSSMSMSSSNHFA.
% 0.23/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.55 # Starting new_ho_10 with 1500s (5) cores
% 0.23/0.55 # Starting new_ho_10_cnf2 with 300s (1) cores
% 0.23/0.55 # Starting full_lambda_6 with 300s (1) cores
% 0.23/0.55 # Starting full_lambda_9 with 300s (1) cores
% 0.23/0.55 # full_lambda_9 with pid 17273 completed with status 0
% 0.23/0.55 # Result found by full_lambda_9
% 0.23/0.55 # Preprocessing class: HSLSSMSMSSSNHFA.
% 0.23/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.55 # Starting new_ho_10 with 1500s (5) cores
% 0.23/0.55 # Starting new_ho_10_cnf2 with 300s (1) cores
% 0.23/0.55 # Starting full_lambda_6 with 300s (1) cores
% 0.23/0.55 # Starting full_lambda_9 with 300s (1) cores
% 0.23/0.55 # SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
% 0.23/0.55 # Search class: HGHSF-FFMM21-SHFFFFBN
% 0.23/0.55 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.55 # Starting new_ho_10 with 163s (1) cores
% 0.23/0.55 # new_ho_10 with pid 17274 completed with status 0
% 0.23/0.55 # Result found by new_ho_10
% 0.23/0.55 # Preprocessing class: HSLSSMSMSSSNHFA.
% 0.23/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.55 # Starting new_ho_10 with 1500s (5) cores
% 0.23/0.55 # Starting new_ho_10_cnf2 with 300s (1) cores
% 0.23/0.55 # Starting full_lambda_6 with 300s (1) cores
% 0.23/0.55 # Starting full_lambda_9 with 300s (1) cores
% 0.23/0.55 # SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
% 0.23/0.55 # Search class: HGHSF-FFMM21-SHFFFFBN
% 0.23/0.55 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.55 # Starting new_ho_10 with 163s (1) cores
% 0.23/0.55 # Preprocessing time : 0.003 s
% 0.23/0.55 # Presaturation interreduction done
% 0.23/0.55
% 0.23/0.55 # Proof found!
% 0.23/0.55 # SZS status Theorem
% 0.23/0.55 # SZS output start CNFRefutation
% See solution above
% 0.23/0.55 # Parsed axioms : 280
% 0.23/0.55 # Removed by relevancy pruning/SinE : 148
% 0.23/0.55 # Initial clauses : 147
% 0.23/0.55 # Removed in clause preprocessing : 6
% 0.23/0.55 # Initial clauses in saturation : 141
% 0.23/0.55 # Processed clauses : 240
% 0.23/0.55 # ...of these trivial : 1
% 0.23/0.55 # ...subsumed : 4
% 0.23/0.55 # ...remaining for further processing : 235
% 0.23/0.55 # Other redundant clauses eliminated : 0
% 0.23/0.55 # Clauses deleted for lack of memory : 0
% 0.23/0.55 # Backward-subsumed : 2
% 0.23/0.55 # Backward-rewritten : 3
% 0.23/0.55 # Generated clauses : 33
% 0.23/0.55 # ...of the previous two non-redundant : 32
% 0.23/0.55 # ...aggressively subsumed : 0
% 0.23/0.55 # Contextual simplify-reflections : 0
% 0.23/0.55 # Paramodulations : 32
% 0.23/0.55 # Factorizations : 0
% 0.23/0.55 # NegExts : 0
% 0.23/0.55 # Equation resolutions : 0
% 0.23/0.55 # Disequality decompositions : 0
% 0.23/0.55 # Total rewrite steps : 5
% 0.23/0.55 # ...of those cached : 1
% 0.23/0.55 # Propositional unsat checks : 0
% 0.23/0.55 # Propositional check models : 0
% 0.23/0.55 # Propositional check unsatisfiable : 0
% 0.23/0.55 # Propositional clauses : 0
% 0.23/0.55 # Propositional clauses after purity: 0
% 0.23/0.55 # Propositional unsat core size : 0
% 0.23/0.55 # Propositional preprocessing time : 0.000
% 0.23/0.55 # Propositional encoding time : 0.000
% 0.23/0.55 # Propositional solver time : 0.000
% 0.23/0.55 # Success case prop preproc time : 0.000
% 0.23/0.55 # Success case prop encoding time : 0.000
% 0.23/0.55 # Success case prop solver time : 0.000
% 0.23/0.55 # Current number of processed clauses : 93
% 0.23/0.55 # Positive orientable unit clauses : 85
% 0.23/0.55 # Positive unorientable unit clauses: 0
% 0.23/0.55 # Negative unit clauses : 2
% 0.23/0.55 # Non-unit-clauses : 6
% 0.23/0.55 # Current number of unprocessed clauses: 68
% 0.23/0.55 # ...number of literals in the above : 121
% 0.23/0.55 # Current number of archived formulas : 0
% 0.23/0.55 # Current number of archived clauses : 142
% 0.23/0.55 # Clause-clause subsumption calls (NU) : 244
% 0.23/0.55 # Rec. Clause-clause subsumption calls : 128
% 0.23/0.55 # Non-unit clause-clause subsumptions : 5
% 0.23/0.55 # Unit Clause-clause subsumption calls : 24
% 0.23/0.55 # Rewrite failures with RHS unbound : 0
% 0.23/0.55 # BW rewrite match attempts : 2
% 0.23/0.55 # BW rewrite match successes : 2
% 0.23/0.55 # Condensation attempts : 241
% 0.23/0.55 # Condensation successes : 1
% 0.23/0.55 # Termbank termtop insertions : 7594
% 0.23/0.55 # Search garbage collected termcells : 1352
% 0.23/0.55
% 0.23/0.55 # -------------------------------------------------
% 0.23/0.55 # User time : 0.016 s
% 0.23/0.55 # System time : 0.004 s
% 0.23/0.55 # Total time : 0.020 s
% 0.23/0.55 # Maximum resident set size: 2372 pages
% 0.23/0.55
% 0.23/0.55 # -------------------------------------------------
% 0.23/0.55 # User time : 0.022 s
% 0.23/0.55 # System time : 0.005 s
% 0.23/0.55 # Total time : 0.027 s
% 0.23/0.55 # Maximum resident set size: 1928 pages
% 0.23/0.55 % E---3.1 exiting
% 0.23/0.55 % E exiting
%------------------------------------------------------------------------------