TSTP Solution File: CSR125^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR125^2 : TPTP v8.2.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:34 EDT 2024
% Result : Theorem 0.13s 0.42s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of formulae : 19 ( 4 unt; 6 typ; 0 def)
% Number of atoms : 46 ( 0 equ; 0 cnn)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 103 ( 22 ~; 12 |; 6 &; 63 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 5 ( 0 ^ 5 !; 0 ?; 5 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_47,type,
holdsDuring_THFTYPE_IiooI: $i > $o > $o ).
thf(decl_65,type,
lBill_THFTYPE_i: $i ).
thf(decl_108,type,
lSue_THFTYPE_i: $i ).
thf(decl_121,type,
lYearFn_THFTYPE_IiiI: $i > $i ).
thf(decl_125,type,
likes_THFTYPE_IiioI: $i > $i > $o ).
thf(decl_133,type,
n2009_THFTYPE_i: $i ).
thf(con,conjecture,
holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
thf(ax_068,axiom,
! [X5: $i] :
( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X5 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_068) ).
thf(ax_082,axiom,
likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_082) ).
thf(c_0_3,negated_conjecture,
~ ( ( ~ ~ $true
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ $true
| ( 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,
! [X5: $i] :
( ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X5 )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X5 )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[ax_068])]) ).
thf(c_0_5,negated_conjecture,
( ( $true
| ~ $true )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ~ $true )
& ( $true
| ~ ( 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(fof_nnf,[status(thm)],[c_0_3])])]) ).
thf(c_0_6,plain,
! [X226: $i] :
( ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X226 )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X226 )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_4])]) ).
thf(c_0_7,negated_conjecture,
( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true )
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_8,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_9,negated_conjecture,
~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ),
inference(cn,[status(thm)],[c_0_7]) ).
thf(c_0_10,plain,
likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i,
inference(split_conjunct,[status(thm)],[ax_082]) ).
thf(c_0_11,plain,
! [X1: $i] :
~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 ),
inference(sr,[status(thm)],[c_0_8,c_0_9]) ).
thf(c_0_12,plain,
$false,
inference(sr,[status(thm)],[c_0_10,c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.09 % Problem : CSR125^2 : TPTP v8.2.0. Released v4.1.0.
% 0.03/0.10 % Command : run_E %s %d THM
% 0.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 300
% 0.10/0.29 % DateTime : Sun May 19 00:41:22 EDT 2024
% 0.10/0.29 % CPUTime :
% 0.13/0.39 Running higher-order theorem proving
% 0.13/0.39 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.13/0.42 # Version: 3.1.0-ho
% 0.13/0.42 # Preprocessing class: HSLMSMSMSSSNHFA.
% 0.13/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.13/0.42 # Starting new_ho_10 with 300s (1) cores
% 0.13/0.42 # Starting new_bool_6 with 300s (1) cores
% 0.13/0.42 # Starting lpo8_s with 300s (1) cores
% 0.13/0.42 # lpo8_s with pid 9631 completed with status 0
% 0.13/0.42 # Result found by lpo8_s
% 0.13/0.42 # Preprocessing class: HSLMSMSMSSSNHFA.
% 0.13/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.13/0.42 # Starting new_ho_10 with 300s (1) cores
% 0.13/0.42 # Starting new_bool_6 with 300s (1) cores
% 0.13/0.42 # Starting lpo8_s with 300s (1) cores
% 0.13/0.42 # SinE strategy is GSinE(CountFormulas,hypos,4.0,,6,20000,1.0)
% 0.13/0.42 # Search class: HGHSF-FFMM21-SHFFFFBN
% 0.13/0.42 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.42 # Starting new_ho_10 with 163s (1) cores
% 0.13/0.42 # new_ho_10 with pid 9639 completed with status 0
% 0.13/0.42 # Result found by new_ho_10
% 0.13/0.42 # Preprocessing class: HSLMSMSMSSSNHFA.
% 0.13/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.13/0.42 # Starting new_ho_10 with 300s (1) cores
% 0.13/0.42 # Starting new_bool_6 with 300s (1) cores
% 0.13/0.42 # Starting lpo8_s with 300s (1) cores
% 0.13/0.42 # SinE strategy is GSinE(CountFormulas,hypos,4.0,,6,20000,1.0)
% 0.13/0.42 # Search class: HGHSF-FFMM21-SHFFFFBN
% 0.13/0.42 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.42 # Starting new_ho_10 with 163s (1) cores
% 0.13/0.42 # Preprocessing time : 0.003 s
% 0.13/0.42 # Presaturation interreduction done
% 0.13/0.42
% 0.13/0.42 # Proof found!
% 0.13/0.42 # SZS status Theorem
% 0.13/0.42 # SZS output start CNFRefutation
% See solution above
% 0.13/0.42 # Parsed axioms : 410
% 0.13/0.42 # Removed by relevancy pruning/SinE : 155
% 0.13/0.42 # Initial clauses : 281
% 0.13/0.42 # Removed in clause preprocessing : 13
% 0.13/0.42 # Initial clauses in saturation : 268
% 0.13/0.42 # Processed clauses : 98
% 0.13/0.42 # ...of these trivial : 1
% 0.13/0.42 # ...subsumed : 3
% 0.13/0.42 # ...remaining for further processing : 93
% 0.13/0.42 # Other redundant clauses eliminated : 0
% 0.13/0.42 # Clauses deleted for lack of memory : 0
% 0.13/0.42 # Backward-subsumed : 0
% 0.13/0.42 # Backward-rewritten : 0
% 0.13/0.42 # Generated clauses : 0
% 0.13/0.42 # ...of the previous two non-redundant : 0
% 0.13/0.42 # ...aggressively subsumed : 0
% 0.13/0.42 # Contextual simplify-reflections : 0
% 0.13/0.42 # Paramodulations : 0
% 0.13/0.42 # Factorizations : 0
% 0.13/0.42 # NegExts : 0
% 0.13/0.42 # Equation resolutions : 0
% 0.13/0.42 # Disequality decompositions : 0
% 0.13/0.42 # Total rewrite steps : 1
% 0.13/0.42 # ...of those cached : 0
% 0.13/0.42 # Propositional unsat checks : 0
% 0.13/0.42 # Propositional check models : 0
% 0.13/0.42 # Propositional check unsatisfiable : 0
% 0.13/0.42 # Propositional clauses : 0
% 0.13/0.42 # Propositional clauses after purity: 0
% 0.13/0.42 # Propositional unsat core size : 0
% 0.13/0.42 # Propositional preprocessing time : 0.000
% 0.13/0.42 # Propositional encoding time : 0.000
% 0.13/0.42 # Propositional solver time : 0.000
% 0.13/0.42 # Success case prop preproc time : 0.000
% 0.13/0.42 # Success case prop encoding time : 0.000
% 0.13/0.42 # Success case prop solver time : 0.000
% 0.13/0.42 # Current number of processed clauses : 93
% 0.13/0.42 # Positive orientable unit clauses : 85
% 0.13/0.42 # Positive unorientable unit clauses: 0
% 0.13/0.42 # Negative unit clauses : 2
% 0.13/0.42 # Non-unit-clauses : 6
% 0.13/0.42 # Current number of unprocessed clauses: 170
% 0.13/0.42 # ...number of literals in the above : 279
% 0.13/0.42 # Current number of archived formulas : 0
% 0.13/0.42 # Current number of archived clauses : 0
% 0.13/0.42 # Clause-clause subsumption calls (NU) : 17
% 0.13/0.42 # Rec. Clause-clause subsumption calls : 15
% 0.13/0.42 # Non-unit clause-clause subsumptions : 3
% 0.13/0.42 # Unit Clause-clause subsumption calls : 3
% 0.13/0.42 # Rewrite failures with RHS unbound : 0
% 0.13/0.42 # BW rewrite match attempts : 0
% 0.13/0.42 # BW rewrite match successes : 0
% 0.13/0.42 # Condensation attempts : 98
% 0.13/0.42 # Condensation successes : 1
% 0.13/0.42 # Termbank termtop insertions : 12339
% 0.13/0.42 # Search garbage collected termcells : 2229
% 0.13/0.42
% 0.13/0.42 # -------------------------------------------------
% 0.13/0.42 # User time : 0.007 s
% 0.13/0.42 # System time : 0.006 s
% 0.13/0.42 # Total time : 0.013 s
% 0.13/0.42 # Maximum resident set size: 2832 pages
% 0.13/0.42
% 0.13/0.42 # -------------------------------------------------
% 0.13/0.42 # User time : 0.013 s
% 0.13/0.42 # System time : 0.007 s
% 0.13/0.42 # Total time : 0.021 s
% 0.13/0.42 # Maximum resident set size: 2048 pages
% 0.13/0.42 % E---3.1 exiting
% 0.13/0.42 % E exiting
%------------------------------------------------------------------------------