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