TSTP Solution File: CSR148^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR148^2 : TPTP v8.2.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:44 EDT 2024
% Result : Theorem 0.21s 0.52s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 13
% Syntax : Number of formulae : 29 ( 7 unt; 8 typ; 0 def)
% Number of atoms : 82 ( 0 equ; 0 cnn)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 212 ( 37 ~; 27 |; 11 &; 131 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 28 ( 0 ^ 24 !; 4 ?; 28 :)
% 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(decl_110,type,
esk1_0: $i ).
thf(ax_024,axiom,
! [X21: $i,X22: $o] :
( ( holdsDuring_THFTYPE_IiooI @ X21 @ ~ X22 )
=> ~ ( holdsDuring_THFTYPE_IiooI @ X21 @ X22 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_024) ).
thf(con,conjecture,
? [X5: $i,X6: $i] : ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ X6 ) @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X5 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
thf(ax_004,axiom,
( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ! [X5: $i] :
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X5 )
=> ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X5 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_004) ).
thf(ax_007,axiom,
! [X9: $o,X6: $i] :
( X9
=> ( holdsDuring_THFTYPE_IiooI @ X6 @ X9 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_007) ).
thf(ax_025,axiom,
likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_025) ).
thf(c_0_5,plain,
! [X21: $i,X22: $o] :
( ( ( X22
| ( holdsDuring_THFTYPE_IiooI @ X21 @ $true ) )
& ( ~ X22
| ( holdsDuring_THFTYPE_IiooI @ X21 @ $false ) ) )
=> ~ ( holdsDuring_THFTYPE_IiooI @ X21 @ X22 ) ),
inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[ax_024])]) ).
thf(c_0_6,negated_conjecture,
~ ? [X5: $i,X6: $i] :
( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X5 )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ X6 ) @ $true ) )
& ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X5 )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ X6 ) @ $false ) ) ),
inference(fool_unroll,[status(thm)],[inference(assume_negation,[status(cth)],[con])]) ).
thf(c_0_7,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 ) )
& ( ! [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 ) @ $false ) ) ),
inference(fool_unroll,[status(thm)],[ax_004]) ).
thf(c_0_8,plain,
! [X106: $i,X107: $o] :
( ( X107
| ~ X107
| ~ ( holdsDuring_THFTYPE_IiooI @ X106 @ X107 ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ X106 @ $false )
| ~ X107
| ~ ( holdsDuring_THFTYPE_IiooI @ X106 @ X107 ) )
& ( X107
| ~ ( holdsDuring_THFTYPE_IiooI @ X106 @ $true )
| ~ ( holdsDuring_THFTYPE_IiooI @ X106 @ X107 ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ X106 @ $false )
| ~ ( holdsDuring_THFTYPE_IiooI @ X106 @ $true )
| ~ ( holdsDuring_THFTYPE_IiooI @ X106 @ X107 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
thf(c_0_9,plain,
! [X102: $o,X103: $i] :
( ~ X102
| ( holdsDuring_THFTYPE_IiooI @ X103 @ X102 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax_007])])]) ).
thf(c_0_10,negated_conjecture,
! [X100: $i,X101: $i] :
( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X100 )
| ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X100 ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ X101 ) @ $false )
| ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X100 ) )
& ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X100 )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ X101 ) @ $true ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ X101 ) @ $false )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ X101 ) @ $true ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
thf(c_0_11,plain,
! [X112: $i] :
( ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ esk1_0 )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ esk1_0 )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X112 )
| ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X112 )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_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_12,plain,
! [X1: $i] :
( ~ ( holdsDuring_THFTYPE_IiooI @ X1 @ $true )
| ~ ( holdsDuring_THFTYPE_IiooI @ X1 @ ~ $true ) ),
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_8])])]) ).
thf(c_0_13,plain,
! [X1: $i] : ( holdsDuring_THFTYPE_IiooI @ X1 @ $true ),
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_9])])]) ).
thf(c_0_14,negated_conjecture,
! [X1: $i,X2: $i] :
( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ X2 ) @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_15,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_11]) ).
thf(c_0_16,plain,
! [X1: $i] :
~ ( holdsDuring_THFTYPE_IiooI @ X1 @ ~ $true ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).
thf(c_0_17,negated_conjecture,
! [X1: $i] :
~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_13])]) ).
thf(c_0_18,plain,
likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i,
inference(split_conjunct,[status(thm)],[ax_025]) ).
thf(c_0_19,plain,
! [X1: $i] :
~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
thf(c_0_20,plain,
$false,
inference(sr,[status(thm)],[c_0_18,c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : CSR148^2 : TPTP v8.2.0. Released v4.1.0.
% 0.14/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n028.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sun May 19 01:07:23 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.49 Running higher-order theorem proving
% 0.21/0.49 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.21/0.52 # Version: 3.1.0-ho
% 0.21/0.52 # Preprocessing class: HSLSSMSMSSSNHFA.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting new_ho_10 with 1500s (5) cores
% 0.21/0.52 # Starting new_ho_10_cnf2 with 300s (1) cores
% 0.21/0.52 # Starting full_lambda_6 with 300s (1) cores
% 0.21/0.52 # Starting full_lambda_9 with 300s (1) cores
% 0.21/0.52 # full_lambda_9 with pid 31532 completed with status 0
% 0.21/0.52 # Result found by full_lambda_9
% 0.21/0.52 # Preprocessing class: HSLSSMSMSSSNHFA.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting new_ho_10 with 1500s (5) cores
% 0.21/0.52 # Starting new_ho_10_cnf2 with 300s (1) cores
% 0.21/0.52 # Starting full_lambda_6 with 300s (1) cores
% 0.21/0.52 # Starting full_lambda_9 with 300s (1) cores
% 0.21/0.52 # SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
% 0.21/0.52 # Search class: HGHSS-FFMM21-SHFFFFBN
% 0.21/0.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting new_ho_10 with 163s (1) cores
% 0.21/0.52 # new_ho_10 with pid 31533 completed with status 0
% 0.21/0.52 # Result found by new_ho_10
% 0.21/0.52 # Preprocessing class: HSLSSMSMSSSNHFA.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting new_ho_10 with 1500s (5) cores
% 0.21/0.52 # Starting new_ho_10_cnf2 with 300s (1) cores
% 0.21/0.52 # Starting full_lambda_6 with 300s (1) cores
% 0.21/0.52 # Starting full_lambda_9 with 300s (1) cores
% 0.21/0.52 # SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
% 0.21/0.52 # Search class: HGHSS-FFMM21-SHFFFFBN
% 0.21/0.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting new_ho_10 with 163s (1) cores
% 0.21/0.52 # Preprocessing time : 0.004 s
% 0.21/0.52 # Presaturation interreduction done
% 0.21/0.52
% 0.21/0.52 # Proof found!
% 0.21/0.52 # SZS status Theorem
% 0.21/0.52 # SZS output start CNFRefutation
% See solution above
% 0.21/0.52 # Parsed axioms : 282
% 0.21/0.52 # Removed by relevancy pruning/SinE : 181
% 0.21/0.52 # Initial clauses : 116
% 0.21/0.52 # Removed in clause preprocessing : 6
% 0.21/0.52 # Initial clauses in saturation : 110
% 0.21/0.52 # Processed clauses : 75
% 0.21/0.52 # ...of these trivial : 5
% 0.21/0.52 # ...subsumed : 4
% 0.21/0.52 # ...remaining for further processing : 66
% 0.21/0.52 # Other redundant clauses eliminated : 0
% 0.21/0.52 # Clauses deleted for lack of memory : 0
% 0.21/0.52 # Backward-subsumed : 0
% 0.21/0.52 # Backward-rewritten : 0
% 0.21/0.52 # Generated clauses : 1
% 0.21/0.52 # ...of the previous two non-redundant : 0
% 0.21/0.52 # ...aggressively subsumed : 0
% 0.21/0.52 # Contextual simplify-reflections : 0
% 0.21/0.52 # Paramodulations : 0
% 0.21/0.52 # Factorizations : 0
% 0.21/0.52 # NegExts : 0
% 0.21/0.52 # Equation resolutions : 0
% 0.21/0.52 # Disequality decompositions : 0
% 0.21/0.52 # Total rewrite steps : 10
% 0.21/0.52 # ...of those cached : 6
% 0.21/0.52 # Propositional unsat checks : 0
% 0.21/0.52 # Propositional check models : 0
% 0.21/0.52 # Propositional check unsatisfiable : 0
% 0.21/0.52 # Propositional clauses : 0
% 0.21/0.52 # Propositional clauses after purity: 0
% 0.21/0.52 # Propositional unsat core size : 0
% 0.21/0.52 # Propositional preprocessing time : 0.000
% 0.21/0.52 # Propositional encoding time : 0.000
% 0.21/0.52 # Propositional solver time : 0.000
% 0.21/0.52 # Success case prop preproc time : 0.000
% 0.21/0.52 # Success case prop encoding time : 0.000
% 0.21/0.52 # Success case prop solver time : 0.000
% 0.21/0.52 # Current number of processed clauses : 65
% 0.21/0.52 # Positive orientable unit clauses : 61
% 0.21/0.52 # Positive unorientable unit clauses: 0
% 0.21/0.52 # Negative unit clauses : 3
% 0.21/0.52 # Non-unit-clauses : 1
% 0.21/0.52 # Current number of unprocessed clauses: 35
% 0.21/0.52 # ...number of literals in the above : 70
% 0.21/0.52 # Current number of archived formulas : 0
% 0.21/0.52 # Current number of archived clauses : 1
% 0.21/0.52 # Clause-clause subsumption calls (NU) : 0
% 0.21/0.52 # Rec. Clause-clause subsumption calls : 0
% 0.21/0.52 # Non-unit clause-clause subsumptions : 0
% 0.21/0.52 # Unit Clause-clause subsumption calls : 4
% 0.21/0.52 # Rewrite failures with RHS unbound : 0
% 0.21/0.52 # BW rewrite match attempts : 0
% 0.21/0.52 # BW rewrite match successes : 0
% 0.21/0.52 # Condensation attempts : 75
% 0.21/0.52 # Condensation successes : 1
% 0.21/0.52 # Termbank termtop insertions : 5674
% 0.21/0.52 # Search garbage collected termcells : 1165
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.006 s
% 0.21/0.52 # System time : 0.007 s
% 0.21/0.52 # Total time : 0.013 s
% 0.21/0.52 # Maximum resident set size: 2360 pages
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.011 s
% 0.21/0.52 # System time : 0.010 s
% 0.21/0.52 # Total time : 0.020 s
% 0.21/0.52 # Maximum resident set size: 1924 pages
% 0.21/0.52 % E---3.1 exiting
% 0.21/0.52 % E exiting
%------------------------------------------------------------------------------