TSTP Solution File: SYO112^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO112^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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 : Tue May 21 08:44:41 EDT 2024
% Result : Theorem 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of formulae : 21 ( 4 unt; 8 typ; 0 def)
% Number of atoms : 63 ( 0 equ; 0 cnn)
% Maximal formula atoms : 32 ( 4 avg)
% Number of connectives : 139 ( 27 ~; 37 |; 7 &; 62 @)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 8 usr; 8 con; 0-1 aty)
% Number of variables : 26 ( 0 ^ 22 !; 4 ?; 26 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
cP: $i > $o ).
thf(decl_23,type,
esk1_0: $i ).
thf(decl_24,type,
esk2_0: $i ).
thf(decl_25,type,
esk3_0: $i ).
thf(decl_26,type,
esk4_0: $i ).
thf(decl_27,type,
esk5_0: $i ).
thf(decl_28,type,
esk6_0: $i ).
thf(decl_29,type,
esk7_0: $i ).
thf(cTHM53,conjecture,
( ! [X1: $i] :
( ( cP @ X1 )
<=> ? [X2: $i] : ( cP @ X2 ) )
<=> ( ! [X1: $i] : ( cP @ X1 )
<=> ? [X2: $i] : ( cP @ X2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM53) ).
thf(c_0_1,negated_conjecture,
~ ( ! [X1: $i] :
( ( cP @ X1 )
<=> ? [X2: $i] : ( cP @ X2 ) )
<=> ( ! [X1: $i] : ( cP @ X1 )
<=> ? [X2: $i] : ( cP @ X2 ) ) ),
inference(assume_negation,[status(cth)],[cTHM53]) ).
thf(c_0_2,negated_conjecture,
! [X8: $i,X11: $i,X12: $i,X14: $i,X16: $i,X17: $i,X20: $i,X21: $i] :
( ( ~ ( cP @ esk3_0 )
| ~ ( cP @ X11 )
| ~ ( cP @ esk1_0 )
| ~ ( cP @ X8 ) )
& ( ( cP @ X12 )
| ( cP @ esk4_0 )
| ~ ( cP @ esk1_0 )
| ~ ( cP @ X8 ) )
& ( ~ ( cP @ esk3_0 )
| ~ ( cP @ X11 )
| ( cP @ esk1_0 )
| ( cP @ esk2_0 ) )
& ( ( cP @ X12 )
| ( cP @ esk4_0 )
| ( cP @ esk1_0 )
| ( cP @ esk2_0 ) )
& ( ~ ( cP @ esk6_0 )
| ( cP @ esk7_0 )
| ~ ( cP @ X14 )
| ( cP @ esk5_0 ) )
& ( ~ ( cP @ X20 )
| ( cP @ X21 )
| ~ ( cP @ X14 )
| ( cP @ esk5_0 ) )
& ( ~ ( cP @ esk6_0 )
| ( cP @ esk7_0 )
| ~ ( cP @ X16 )
| ( cP @ X17 ) )
& ( ~ ( cP @ X20 )
| ( cP @ X21 )
| ~ ( cP @ X16 )
| ( cP @ X17 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])])]) ).
thf(c_0_3,negated_conjecture,
! [X1: $i,X2: $i] :
( ~ ( cP @ esk3_0 )
| ~ ( cP @ X1 )
| ~ ( cP @ esk1_0 )
| ~ ( cP @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X1: $i,X2: $i,X4: $i,X3: $i] :
( ( cP @ X2 )
| ( cP @ X4 )
| ~ ( cP @ X1 )
| ~ ( cP @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X1: $i] :
( ( cP @ X1 )
| ( cP @ esk4_0 )
| ( cP @ esk1_0 )
| ( cP @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
( ~ ( cP @ esk1_0 )
| ~ ( cP @ esk3_0 ) ),
inference(condense,[status(thm)],[c_0_3]) ).
thf(c_0_7,negated_conjecture,
! [X1: $i,X2: $i] :
( ( cP @ X1 )
| ~ ( cP @ X2 ) ),
inference(condense,[status(thm)],[c_0_4]) ).
thf(c_0_8,negated_conjecture,
( ( cP @ esk4_0 )
| ( cP @ esk2_0 )
| ( cP @ esk1_0 ) ),
inference(condense,[status(thm)],[c_0_5]) ).
thf(c_0_9,negated_conjecture,
~ ( cP @ esk1_0 ),
inference(csr,[status(thm)],[c_0_6,c_0_7]) ).
thf(c_0_10,negated_conjecture,
cP @ esk2_0,
inference(csr,[status(thm)],[inference(sr,[status(thm)],[c_0_8,c_0_9]),c_0_7]) ).
thf(c_0_11,negated_conjecture,
! [X1: $i] : ( cP @ X1 ),
inference(spm,[status(thm)],[c_0_7,c_0_10]) ).
thf(c_0_12,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO112^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 09:57:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.49 Running higher-order theorem proving
% 0.20/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.20/0.50 # Version: 3.1.0-ho
% 0.20/0.50 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.50 # Starting ho_unfolding_6 with 300s (1) cores
% 0.20/0.50 # Starting sh4l with 300s (1) cores
% 0.20/0.50 # Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.20/0.50 # ho_unfolding_6 with pid 2048 completed with status 0
% 0.20/0.50 # Result found by ho_unfolding_6
% 0.20/0.50 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.50 # Starting ho_unfolding_6 with 300s (1) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: HGHNF-FFSF00-SFFFFFNN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting new_ho_10 with 181s (1) cores
% 0.20/0.50 # new_ho_10 with pid 2052 completed with status 0
% 0.20/0.50 # Result found by new_ho_10
% 0.20/0.50 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.50 # Starting ho_unfolding_6 with 300s (1) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: HGHNF-FFSF00-SFFFFFNN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting new_ho_10 with 181s (1) cores
% 0.20/0.50 # Preprocessing time : 0.001 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Theorem
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 2
% 0.20/0.50 # Removed by relevancy pruning/SinE : 0
% 0.20/0.50 # Initial clauses : 9
% 0.20/0.50 # Removed in clause preprocessing : 1
% 0.20/0.50 # Initial clauses in saturation : 8
% 0.20/0.50 # Processed clauses : 13
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 0
% 0.20/0.50 # ...remaining for further processing : 13
% 0.20/0.50 # Other redundant clauses eliminated : 0
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 5
% 0.20/0.50 # Backward-rewritten : 3
% 0.20/0.50 # Generated clauses : 3
% 0.20/0.50 # ...of the previous two non-redundant : 3
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 2
% 0.20/0.50 # Paramodulations : 2
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 0
% 0.20/0.50 # Disequality decompositions : 0
% 0.20/0.50 # Total rewrite steps : 3
% 0.20/0.50 # ...of those cached : 0
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 1
% 0.20/0.50 # Positive orientable unit clauses : 1
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 0
% 0.20/0.50 # Non-unit-clauses : 0
% 0.20/0.50 # Current number of unprocessed clauses: 1
% 0.20/0.50 # ...number of literals in the above : 3
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 12
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 20
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 20
% 0.20/0.50 # Non-unit clause-clause subsumptions : 20
% 0.20/0.50 # Unit Clause-clause subsumption calls : 0
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 4
% 0.20/0.50 # BW rewrite match successes : 4
% 0.20/0.50 # Condensation attempts : 13
% 0.20/0.50 # Condensation successes : 8
% 0.20/0.50 # Termbank termtop insertions : 927
% 0.20/0.50 # Search garbage collected termcells : 255
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.003 s
% 0.20/0.50 # System time : 0.001 s
% 0.20/0.50 # Total time : 0.004 s
% 0.20/0.50 # Maximum resident set size: 1760 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.004 s
% 0.20/0.50 # System time : 0.003 s
% 0.20/0.50 # Total time : 0.007 s
% 0.20/0.50 # Maximum resident set size: 1692 pages
% 0.20/0.50 % E---3.1 exiting
% 0.20/0.50 % E exiting
%------------------------------------------------------------------------------