TSTP Solution File: SEV434^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEV434^1 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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 04:08:23 EDT 2024
% Result : Theorem 0.21s 0.52s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 23 ( 5 unt; 5 typ; 0 def)
% Number of atoms : 55 ( 37 equ; 0 cnn)
% Maximal formula atoms : 5 ( 3 avg)
% Number of connectives : 53 ( 11 ~; 21 |; 3 &; 18 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 5 con; 0-2 aty)
% Number of variables : 22 ( 0 ^ 21 !; 1 ?; 22 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
f: $o > $i ).
thf(decl_23,type,
epred1_1: $i > $o ).
thf(decl_24,type,
esk1_0: $i ).
thf(decl_25,type,
esk2_0: $i ).
thf(decl_26,type,
esk3_0: $i ).
thf(fsurj,axiom,
! [X1: $i] :
? [X2: $o] :
( ( f @ X2 )
= X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fsurj) ).
thf(less3,conjecture,
! [X3: $i,X1: $i,X4: $i] :
( ( X3 = X1 )
| ( X3 = X4 )
| ( X1 = X4 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less3) ).
thf(c_0_2,plain,
! [X10: $i] :
( ( ~ ( epred1_1 @ X10 )
| ( ( f @ $true )
= X10 ) )
& ( ( epred1_1 @ X10 )
| ( ( f @ $false )
= X10 ) ) ),
inference(fool_unroll,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[fsurj])])]) ).
thf(c_0_3,plain,
! [X1: $i] :
( ( ( f @ $true )
= X1 )
| ~ ( epred1_1 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,plain,
! [X1: $i] :
( ( epred1_1 @ X1 )
| ( ( f @ ~ $true )
= X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
~ ! [X3: $i,X1: $i,X4: $i] :
( ( X3 = X1 )
| ( X3 = X4 )
| ( X1 = X4 ) ),
inference(assume_negation,[status(cth)],[less3]) ).
thf(c_0_6,plain,
! [X1: $i] :
( ( ( f @ ~ $true )
= X1 )
| ( ( f @ $true )
= X1 ) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_7,negated_conjecture,
( ( esk1_0 != esk2_0 )
& ( esk1_0 != esk3_0 )
& ( esk2_0 != esk3_0 ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
thf(c_0_8,plain,
! [X1: $i,X3: $i] :
( ( ( f @ $true )
= X1 )
| ( ( f @ $true )
= X3 )
| ( X1 = X3 ) ),
inference(spm,[status(thm)],[c_0_6,c_0_6]) ).
thf(c_0_9,negated_conjecture,
esk1_0 != esk3_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_10,plain,
! [X5: $i,X1: $i,X3: $i,X4: $i] :
( ( ( f @ $true )
= X1 )
| ( X1 = X3 )
| ( X4 = X5 )
| ( X3 = X5 )
| ( X3 = X4 ) ),
inference(spm,[status(thm)],[c_0_8,c_0_8]) ).
thf(c_0_11,negated_conjecture,
! [X3: $i,X1: $i] :
( ( ( f @ $true )
= X1 )
| ( esk1_0 = X3 )
| ( esk3_0 = X3 )
| ( X1 = esk1_0 ) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10])]) ).
thf(c_0_12,negated_conjecture,
esk2_0 != esk3_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_13,negated_conjecture,
esk1_0 != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_14,negated_conjecture,
( ( ( f @ $true )
= esk3_0 )
| ( ( f @ $true )
= esk1_0 ) ),
inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_11])]),c_0_9]) ).
thf(c_0_15,negated_conjecture,
! [X1: $i] :
( ( ( f @ $true )
= X1 )
| ( X1 = esk1_0 ) ),
inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_11])]),c_0_13]) ).
thf(c_0_16,negated_conjecture,
! [X1: $i] :
( ( X1 = esk1_0 )
| ( X1 = esk3_0 ) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
thf(c_0_17,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_16])]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SEV434^1 : TPTP v8.2.0. Released v5.2.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n004.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.36 % DateTime : Sun May 19 18:33:23 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.50 Running higher-order theorem proving
% 0.21/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.21/0.52 # Version: 3.1.0-ho
% 0.21/0.52 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting new_ho_10 with 1500s (5) cores
% 0.21/0.52 # Starting ho_unfolding_6 with 300s (1) cores
% 0.21/0.52 # Starting sh4l with 300s (1) cores
% 0.21/0.52 # Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.21/0.52 # new_ho_10 with pid 29822 completed with status 0
% 0.21/0.52 # Result found by new_ho_10
% 0.21/0.52 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting new_ho_10 with 1500s (5) cores
% 0.21/0.52 # No SInE strategy applied
% 0.21/0.52 # Search class: HGUSF-FFSF11-SFFFFFNN
% 0.21/0.52 # partial match(1): HGUNF-FFSF11-SFFFFFNN
% 0.21/0.52 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.52 # Starting new_ho_10 with 901s (1) cores
% 0.21/0.52 # Starting sh5l with 151s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 151s (1) cores
% 0.21/0.52 # Starting new_bool_2 with 151s (1) cores
% 0.21/0.52 # Starting new_bool_9 with 146s (1) cores
% 0.21/0.52 # new_bool_9 with pid 29830 completed with status 0
% 0.21/0.52 # Result found by new_bool_9
% 0.21/0.52 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting new_ho_10 with 1500s (5) cores
% 0.21/0.52 # No SInE strategy applied
% 0.21/0.52 # Search class: HGUSF-FFSF11-SFFFFFNN
% 0.21/0.52 # partial match(1): HGUNF-FFSF11-SFFFFFNN
% 0.21/0.52 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.52 # Starting new_ho_10 with 901s (1) cores
% 0.21/0.52 # Starting sh5l with 151s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 151s (1) cores
% 0.21/0.52 # Starting new_bool_2 with 151s (1) cores
% 0.21/0.52 # Starting new_bool_9 with 146s (1) cores
% 0.21/0.52 # Preprocessing time : 0.001 s
% 0.21/0.52 # Presaturation interreduction done
% 0.21/0.52
% 0.21/0.52 # Proof found!
% 0.21/0.52 # SZS status Theorem
% 0.21/0.52 # SZS output start CNFRefutation
% See solution above
% 0.21/0.52 # Parsed axioms : 3
% 0.21/0.52 # Removed by relevancy pruning/SinE : 0
% 0.21/0.52 # Initial clauses : 6
% 0.21/0.52 # Removed in clause preprocessing : 1
% 0.21/0.52 # Initial clauses in saturation : 5
% 0.21/0.52 # Processed clauses : 31
% 0.21/0.52 # ...of these trivial : 0
% 0.21/0.52 # ...subsumed : 10
% 0.21/0.52 # ...remaining for further processing : 21
% 0.21/0.52 # Other redundant clauses eliminated : 84
% 0.21/0.52 # Clauses deleted for lack of memory : 0
% 0.21/0.52 # Backward-subsumed : 4
% 0.21/0.52 # Backward-rewritten : 0
% 0.21/0.52 # Generated clauses : 375
% 0.21/0.52 # ...of the previous two non-redundant : 188
% 0.21/0.52 # ...aggressively subsumed : 0
% 0.21/0.52 # Contextual simplify-reflections : 0
% 0.21/0.52 # Paramodulations : 164
% 0.21/0.52 # Factorizations : 121
% 0.21/0.52 # NegExts : 0
% 0.21/0.52 # Equation resolutions : 84
% 0.21/0.52 # Disequality decompositions : 0
% 0.21/0.52 # Total rewrite steps : 0
% 0.21/0.52 # ...of those cached : 0
% 0.21/0.52 # Propositional unsat checks : 0
% 0.21/0.52 # Propositional check models : 0
% 0.21/0.52 # Propositional check unsatisfiable : 0
% 0.21/0.52 # Propositional clauses : 0
% 0.21/0.52 # Propositional clauses after purity: 0
% 0.21/0.52 # Propositional unsat core size : 0
% 0.21/0.52 # Propositional preprocessing time : 0.000
% 0.21/0.52 # Propositional encoding time : 0.000
% 0.21/0.52 # Propositional solver time : 0.000
% 0.21/0.52 # Success case prop preproc time : 0.000
% 0.21/0.52 # Success case prop encoding time : 0.000
% 0.21/0.52 # Success case prop solver time : 0.000
% 0.21/0.52 # Current number of processed clauses : 12
% 0.21/0.52 # Positive orientable unit clauses : 0
% 0.21/0.52 # Positive unorientable unit clauses: 0
% 0.21/0.52 # Negative unit clauses : 3
% 0.21/0.52 # Non-unit-clauses : 9
% 0.21/0.52 # Current number of unprocessed clauses: 157
% 0.21/0.52 # ...number of literals in the above : 761
% 0.21/0.52 # Current number of archived formulas : 0
% 0.21/0.52 # Current number of archived clauses : 9
% 0.21/0.52 # Clause-clause subsumption calls (NU) : 24
% 0.21/0.52 # Rec. Clause-clause subsumption calls : 19
% 0.21/0.52 # Non-unit clause-clause subsumptions : 12
% 0.21/0.52 # Unit Clause-clause subsumption calls : 0
% 0.21/0.52 # Rewrite failures with RHS unbound : 0
% 0.21/0.52 # BW rewrite match attempts : 0
% 0.21/0.52 # BW rewrite match successes : 0
% 0.21/0.52 # Condensation attempts : 0
% 0.21/0.52 # Condensation successes : 0
% 0.21/0.52 # Termbank termtop insertions : 846
% 0.21/0.52 # Search garbage collected termcells : 59
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.008 s
% 0.21/0.52 # System time : 0.004 s
% 0.21/0.52 # Total time : 0.012 s
% 0.21/0.52 # Maximum resident set size: 1752 pages
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.046 s
% 0.21/0.52 # System time : 0.009 s
% 0.21/0.52 # Total time : 0.055 s
% 0.21/0.52 # Maximum resident set size: 1700 pages
% 0.21/0.52 % E---3.1 exiting
% 0.21/0.53 % E exiting
%------------------------------------------------------------------------------