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