TSTP Solution File: SYO379^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO379^5 : TPTP v8.2.0. Bugfixed v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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:45:48 EDT 2024
% Result : Theorem 0.15s 0.43s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 17 ( 11 unt; 4 typ; 0 def)
% Number of atoms : 31 ( 23 equ; 0 cnn)
% Maximal formula atoms : 2 ( 2 avg)
% Number of connectives : 49 ( 9 ~; 9 |; 5 &; 25 @)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 13 ( 13 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 24 ( 10 ^ 8 !; 6 ?; 24 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
c: $i ).
thf(decl_23,type,
cQDP0: $i > $o ).
thf(decl_24,type,
cQDP1: ( $i > $o ) > $o ).
thf(decl_25,type,
esk1_1: ( $i > $o ) > $i ).
thf(cQDP1_def,axiom,
( cQDP1
= ( ^ [X2: $i > $o] :
( ( X2 = cQDP0 )
& ? [X3: $i] : ( X2 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cQDP1_def) ).
thf(cQDP0_def,axiom,
( cQDP0
= ( ^ [X1: $i] : ( X1 = c ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cQDP0_def) ).
thf(cQDTHM1,conjecture,
? [X4: $i > $o] : ( cQDP1 @ X4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cQDTHM1) ).
thf(c_0_3,plain,
( cQDP1
= ( ^ [Z0: $i > $o] :
( ( Z0
= ( ^ [Z1: $i] : ( Z1 = c ) ) )
& ? [X3: $i] : ( Z0 @ X3 ) ) ) ),
inference(fof_simplification,[status(thm)],[cQDP1_def]) ).
thf(c_0_4,plain,
( cQDP0
= ( ^ [Z0: $i] : ( Z0 = c ) ) ),
inference(fof_simplification,[status(thm)],[cQDP0_def]) ).
thf(c_0_5,plain,
( cQDP1
= ( ^ [Z0: $i > $o] :
( ( Z0
= ( ^ [Z1: $i] : ( Z1 = c ) ) )
& ? [X3: $i] : ( Z0 @ X3 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_6,negated_conjecture,
~ ? [X4: $i > $o] :
( ! [X7: $i] :
( ( X4 @ X7 )
<=> ( X7 = c ) )
& ? [X6: $i] : ( X4 @ X6 ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[cQDTHM1]),c_0_5])]) ).
thf(c_0_7,negated_conjecture,
! [X8: $i > $o,X10: $i] :
( ( ~ ( X8 @ ( esk1_1 @ X8 ) )
| ( ( esk1_1 @ X8 )
!= c )
| ~ ( X8 @ X10 ) )
& ( ( X8 @ ( esk1_1 @ X8 ) )
| ( ( esk1_1 @ X8 )
= c )
| ~ ( X8 @ X10 ) ) ),
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_6])])])])])]) ).
thf(c_0_8,negated_conjecture,
! [X2: $i > $o,X1: $i] :
( ( X2 @ ( esk1_1 @ X2 ) )
| ( ( esk1_1 @ X2 )
= c )
| ~ ( X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_9,negated_conjecture,
! [X1: $i] :
( ( ( esk1_1
@ ^ [Z0: $i] : ( Z0 = X1 ) )
= c )
| ( ( esk1_1
@ ^ [Z0: $i] : ( Z0 = X1 ) )
= X1 ) ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_8]) ).
thf(c_0_10,negated_conjecture,
! [X2: $i > $o,X1: $i] :
( ~ ( X2 @ ( esk1_1 @ X2 ) )
| ( ( esk1_1 @ X2 )
!= c )
| ~ ( X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_11,negated_conjecture,
( ( esk1_1
@ ^ [Z0: $i] : ( Z0 = c ) )
= c ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_9])]) ).
thf(c_0_12,negated_conjecture,
$false,
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11])])])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.10 % Problem : SYO379^5 : TPTP v8.2.0. Bugfixed v5.2.0.
% 0.04/0.11 % Command : run_E %s %d THM
% 0.11/0.30 % Computer : n010.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.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Mon May 20 11:01:07 EDT 2024
% 0.11/0.31 % CPUTime :
% 0.15/0.42 Running higher-order theorem proving
% 0.15/0.42 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.15/0.43 # Version: 3.1.0-ho
% 0.15/0.43 # Preprocessing class: HSSSSMSSSLSNHSN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.15/0.43 # Starting lpo8_lambda_fix with 300s (1) cores
% 0.15/0.43 # Starting lpo8_s with 300s (1) cores
% 0.15/0.43 # Starting new_bool_11 with 300s (1) cores
% 0.15/0.43 # ho_unfolding_3 with pid 1299 completed with status 0
% 0.15/0.43 # Result found by ho_unfolding_3
% 0.15/0.43 # Preprocessing class: HSSSSMSSSLSNHSN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.15/0.43 # No SInE strategy applied
% 0.15/0.43 # Search class: HGHSF-FFSF11-SHSFMMBN
% 0.15/0.43 # partial match(1): HGHSF-FFSF21-SHSFMMBN
% 0.15/0.43 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.43 # Starting new_ho_10 with 811s (1) cores
% 0.15/0.43 # Starting ho_unfolding_3 with 151s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 136s (1) cores
% 0.15/0.43 # Starting new_bool_2 with 136s (1) cores
% 0.15/0.43 # Starting new_bool_9 with 136s (1) cores
% 0.15/0.43 # new_ho_10 with pid 1305 completed with status 9
% 0.15/0.43 # Starting sh5l with 130s (1) cores
% 0.15/0.43 # ho_unfolding_3 with pid 1306 completed with status 0
% 0.15/0.43 # Result found by ho_unfolding_3
% 0.15/0.43 # Preprocessing class: HSSSSMSSSLSNHSN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.15/0.43 # No SInE strategy applied
% 0.15/0.43 # Search class: HGHSF-FFSF11-SHSFMMBN
% 0.15/0.43 # partial match(1): HGHSF-FFSF21-SHSFMMBN
% 0.15/0.43 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.43 # Starting new_ho_10 with 811s (1) cores
% 0.15/0.43 # Starting ho_unfolding_3 with 151s (1) cores
% 0.15/0.43 # Preprocessing time : 0.001 s
% 0.15/0.43 # Presaturation interreduction done
% 0.15/0.43
% 0.15/0.43 # Proof found!
% 0.15/0.43 # SZS status Theorem
% 0.15/0.43 # SZS output start CNFRefutation
% See solution above
% 0.15/0.43 # Parsed axioms : 6
% 0.15/0.43 # Removed by relevancy pruning/SinE : 0
% 0.15/0.43 # Initial clauses : 5
% 0.15/0.43 # Removed in clause preprocessing : 3
% 0.15/0.43 # Initial clauses in saturation : 2
% 0.15/0.43 # Processed clauses : 7
% 0.15/0.43 # ...of these trivial : 0
% 0.15/0.43 # ...subsumed : 0
% 0.15/0.43 # ...remaining for further processing : 7
% 0.15/0.43 # Other redundant clauses eliminated : 7
% 0.15/0.43 # Clauses deleted for lack of memory : 0
% 0.15/0.43 # Backward-subsumed : 0
% 0.15/0.43 # Backward-rewritten : 0
% 0.15/0.43 # Generated clauses : 18
% 0.15/0.43 # ...of the previous two non-redundant : 10
% 0.15/0.43 # ...aggressively subsumed : 0
% 0.15/0.43 # Contextual simplify-reflections : 0
% 0.15/0.43 # Paramodulations : 3
% 0.15/0.43 # Factorizations : 2
% 0.15/0.43 # NegExts : 1
% 0.15/0.43 # Equation resolutions : 8
% 0.15/0.43 # Disequality decompositions : 0
% 0.15/0.43 # Total rewrite steps : 0
% 0.15/0.43 # ...of those cached : 0
% 0.15/0.43 # Propositional unsat checks : 0
% 0.15/0.43 # Propositional check models : 0
% 0.15/0.43 # Propositional check unsatisfiable : 0
% 0.15/0.43 # Propositional clauses : 0
% 0.15/0.43 # Propositional clauses after purity: 0
% 0.15/0.43 # Propositional unsat core size : 0
% 0.15/0.43 # Propositional preprocessing time : 0.000
% 0.15/0.43 # Propositional encoding time : 0.000
% 0.15/0.43 # Propositional solver time : 0.000
% 0.15/0.43 # Success case prop preproc time : 0.000
% 0.15/0.43 # Success case prop encoding time : 0.000
% 0.15/0.43 # Success case prop solver time : 0.000
% 0.15/0.43 # Current number of processed clauses : 5
% 0.15/0.43 # Positive orientable unit clauses : 1
% 0.15/0.43 # Positive unorientable unit clauses: 0
% 0.15/0.43 # Negative unit clauses : 0
% 0.15/0.43 # Non-unit-clauses : 4
% 0.15/0.43 # Current number of unprocessed clauses: 7
% 0.15/0.43 # ...number of literals in the above : 18
% 0.15/0.43 # Current number of archived formulas : 0
% 0.15/0.43 # Current number of archived clauses : 2
% 0.15/0.43 # Clause-clause subsumption calls (NU) : 6
% 0.15/0.43 # Rec. Clause-clause subsumption calls : 3
% 0.15/0.43 # Non-unit clause-clause subsumptions : 0
% 0.15/0.43 # Unit Clause-clause subsumption calls : 2
% 0.15/0.43 # Rewrite failures with RHS unbound : 0
% 0.15/0.43 # BW rewrite match attempts : 0
% 0.15/0.43 # BW rewrite match successes : 0
% 0.15/0.43 # Condensation attempts : 7
% 0.15/0.43 # Condensation successes : 0
% 0.15/0.43 # Termbank termtop insertions : 624
% 0.15/0.43 # Search garbage collected termcells : 99
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.003 s
% 0.15/0.43 # System time : 0.002 s
% 0.15/0.43 # Total time : 0.005 s
% 0.15/0.43 # Maximum resident set size: 1784 pages
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.010 s
% 0.15/0.43 # System time : 0.004 s
% 0.15/0.43 # Total time : 0.014 s
% 0.15/0.43 # Maximum resident set size: 1712 pages
% 0.15/0.43 % E---3.1 exiting
% 0.15/0.43 % E exiting
%------------------------------------------------------------------------------