TSTP Solution File: SEU932^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU932^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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 03:30:53 EDT 2024
% Result : Theorem 0.19s 0.47s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 13 ( 6 unt; 3 typ; 0 def)
% Number of atoms : 23 ( 22 equ; 0 cnn)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 53 ( 5 ~; 2 |; 7 &; 35 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 23 ( 8 ^ 9 !; 6 ?; 23 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
esk1_0: $i > $i ).
thf(decl_23,type,
esk2_0: $i > $i ).
thf(decl_24,type,
esk3_0: $i ).
thf(cTHM141_pme,conjecture,
! [X1: $i > $i] :
( ? [X2: $i > $i] :
( ( ( ^ [X3: $i] : ( X1 @ ( X2 @ X3 ) ) )
= ( ^ [X3: $i] : ( X2 @ ( X1 @ X3 ) ) ) )
& ? [X3: $i] :
( ( ( X2 @ X3 )
= X3 )
& ! [X4: $i] :
( ( ( X2 @ X4 )
= X4 )
=> ( X4 = X3 ) ) ) )
=> ? [X5: $i] :
( ( X1 @ X5 )
= X5 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM141_pme) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: $i > $i] :
( ? [X2: $i > $i] :
( ( ( ^ [Z0: $i] : ( X1 @ ( X2 @ Z0 ) ) )
= ( ^ [Z0: $i] : ( X2 @ ( X1 @ Z0 ) ) ) )
& ? [X3: $i] :
( ( ( X2 @ X3 )
= X3 )
& ! [X4: $i] :
( ( ( X2 @ X4 )
= X4 )
=> ( X4 = X3 ) ) ) )
=> ? [X5: $i] :
( ( X1 @ X5 )
= X5 ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM141_pme])]) ).
thf(c_0_2,negated_conjecture,
! [X14: $i,X15: $i] :
( ( ( ^ [Z0: $i] : ( esk1_0 @ ( esk2_0 @ Z0 ) ) )
= ( ^ [Z0: $i] : ( esk2_0 @ ( esk1_0 @ Z0 ) ) ) )
& ( ( esk2_0 @ esk3_0 )
= esk3_0 )
& ( ( ( esk2_0 @ X14 )
!= X14 )
| ( X14 = esk3_0 ) )
& ( ( esk1_0 @ X15 )
!= X15 ) ),
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,
( ( ^ [Z0: $i] : ( esk1_0 @ ( esk2_0 @ Z0 ) ) )
= ( ^ [Z0: $i] : ( esk2_0 @ ( esk1_0 @ Z0 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X3: $i] :
( ( esk1_0 @ ( esk2_0 @ X3 ) )
= ( esk2_0 @ ( esk1_0 @ X3 ) ) ),
inference(arg_cong,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
( ( esk2_0 @ esk3_0 )
= esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
! [X3: $i] :
( ( X3 = esk3_0 )
| ( ( esk2_0 @ X3 )
!= X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
( ( esk2_0 @ ( esk1_0 @ esk3_0 ) )
= ( esk1_0 @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
thf(c_0_8,negated_conjecture,
! [X3: $i] :
( ( esk1_0 @ X3 )
!= X3 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_9,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU932^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n024.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Sun May 19 17:11:08 EDT 2024
% 0.13/0.33 % CPUTime :
% 0.19/0.46 Running higher-order theorem proving
% 0.19/0.46 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.19/0.47 # Version: 3.1.0-ho
% 0.19/0.47 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.19/0.47 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting post_as_ho12 with 300s (1) cores
% 0.19/0.47 # Starting new_bool_9 with 300s (1) cores
% 0.19/0.47 # Starting post_as_ho1 with 300s (1) cores
% 0.19/0.47 # Starting post_as_ho4 with 300s (1) cores
% 0.19/0.47 # Starting post_as_ho2 with 300s (1) cores
% 0.19/0.47 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.19/0.47 # Starting full_lambda_10 with 300s (1) cores
% 0.19/0.47 # Starting new_ho_8 with 300s (1) cores
% 0.19/0.47 # new_bool_9 with pid 32616 completed with status 0
% 0.19/0.47 # Result found by new_bool_9
% 0.19/0.47 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.19/0.47 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting post_as_ho12 with 300s (1) cores
% 0.19/0.47 # Starting new_bool_9 with 300s (1) cores
% 0.19/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.19/0.47 # Search class: HHUPF-FFSF00-MSSFFFNN
% 0.19/0.47 # partial match(1): HHUPF-FFSF00-SSSFFFNN
% 0.19/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.47 # Starting new_ho_10 with 181s (1) cores
% 0.19/0.47 # new_ho_10 with pid 32624 completed with status 0
% 0.19/0.47 # Result found by new_ho_10
% 0.19/0.47 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.19/0.47 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting post_as_ho12 with 300s (1) cores
% 0.19/0.47 # Starting new_bool_9 with 300s (1) cores
% 0.19/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.19/0.47 # Search class: HHUPF-FFSF00-MSSFFFNN
% 0.19/0.47 # partial match(1): HHUPF-FFSF00-SSSFFFNN
% 0.19/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.47 # Starting new_ho_10 with 181s (1) cores
% 0.19/0.47 # Preprocessing time : 0.001 s
% 0.19/0.47 # Presaturation interreduction done
% 0.19/0.47
% 0.19/0.47 # Proof found!
% 0.19/0.47 # SZS status Theorem
% 0.19/0.47 # SZS output start CNFRefutation
% See solution above
% 0.19/0.47 # Parsed axioms : 1
% 0.19/0.47 # Removed by relevancy pruning/SinE : 0
% 0.19/0.47 # Initial clauses : 4
% 0.19/0.47 # Removed in clause preprocessing : 0
% 0.19/0.47 # Initial clauses in saturation : 4
% 0.19/0.47 # Processed clauses : 10
% 0.19/0.47 # ...of these trivial : 0
% 0.19/0.47 # ...subsumed : 0
% 0.19/0.47 # ...remaining for further processing : 10
% 0.19/0.47 # Other redundant clauses eliminated : 0
% 0.19/0.47 # Clauses deleted for lack of memory : 0
% 0.19/0.47 # Backward-subsumed : 0
% 0.19/0.47 # Backward-rewritten : 0
% 0.19/0.47 # Generated clauses : 5
% 0.19/0.47 # ...of the previous two non-redundant : 4
% 0.19/0.47 # ...aggressively subsumed : 0
% 0.19/0.47 # Contextual simplify-reflections : 0
% 0.19/0.47 # Paramodulations : 4
% 0.19/0.47 # Factorizations : 0
% 0.19/0.47 # NegExts : 0
% 0.19/0.47 # Equation resolutions : 0
% 0.19/0.47 # Disequality decompositions : 0
% 0.19/0.47 # Total rewrite steps : 0
% 0.19/0.47 # ...of those cached : 0
% 0.19/0.47 # Propositional unsat checks : 0
% 0.19/0.47 # Propositional check models : 0
% 0.19/0.47 # Propositional check unsatisfiable : 0
% 0.19/0.47 # Propositional clauses : 0
% 0.19/0.47 # Propositional clauses after purity: 0
% 0.19/0.47 # Propositional unsat core size : 0
% 0.19/0.47 # Propositional preprocessing time : 0.000
% 0.19/0.47 # Propositional encoding time : 0.000
% 0.19/0.47 # Propositional solver time : 0.000
% 0.19/0.47 # Success case prop preproc time : 0.000
% 0.19/0.47 # Success case prop encoding time : 0.000
% 0.19/0.47 # Success case prop solver time : 0.000
% 0.19/0.47 # Current number of processed clauses : 6
% 0.19/0.47 # Positive orientable unit clauses : 4
% 0.19/0.47 # Positive unorientable unit clauses: 0
% 0.19/0.47 # Negative unit clauses : 1
% 0.19/0.47 # Non-unit-clauses : 1
% 0.19/0.47 # Current number of unprocessed clauses: 1
% 0.19/0.47 # ...number of literals in the above : 1
% 0.19/0.47 # Current number of archived formulas : 0
% 0.19/0.47 # Current number of archived clauses : 4
% 0.19/0.47 # Clause-clause subsumption calls (NU) : 0
% 0.19/0.47 # Rec. Clause-clause subsumption calls : 0
% 0.19/0.47 # Non-unit clause-clause subsumptions : 0
% 0.19/0.47 # Unit Clause-clause subsumption calls : 0
% 0.19/0.47 # Rewrite failures with RHS unbound : 0
% 0.19/0.47 # BW rewrite match attempts : 0
% 0.19/0.47 # BW rewrite match successes : 0
% 0.19/0.47 # Condensation attempts : 10
% 0.19/0.47 # Condensation successes : 0
% 0.19/0.47 # Termbank termtop insertions : 342
% 0.19/0.47 # Search garbage collected termcells : 140
% 0.19/0.47
% 0.19/0.47 # -------------------------------------------------
% 0.19/0.47 # User time : 0.004 s
% 0.19/0.47 # System time : 0.000 s
% 0.19/0.47 # Total time : 0.004 s
% 0.19/0.47 # Maximum resident set size: 1812 pages
% 0.19/0.47
% 0.19/0.47 # -------------------------------------------------
% 0.19/0.47 # User time : 0.005 s
% 0.19/0.47 # System time : 0.003 s
% 0.19/0.47 # Total time : 0.007 s
% 0.19/0.47 # Maximum resident set size: 1688 pages
% 0.19/0.47 % E---3.1 exiting
% 0.19/0.47 % E exiting
%------------------------------------------------------------------------------