TSTP Solution File: SWV447^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWV447^1 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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 05:24:53 EDT 2024
% Result : Theorem 0.22s 0.51s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of formulae : 16 ( 12 unt; 4 typ; 0 def)
% Number of atoms : 12 ( 11 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 67 ( 3 ~; 0 |; 0 &; 64 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 20 ( 4 ^ 16 !; 0 ?; 20 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
nil: $i ).
thf(decl_23,type,
cons: $i > $i > $i ).
thf(decl_24,type,
map: ( $i > $i ) > $i > $i ).
thf(decl_25,type,
esk1_0: $i ).
thf(test,conjecture,
! [X4: $i] :
( ( map
@ ^ [X2: $i] : X2
@ ( cons @ X4 @ nil ) )
= ( cons @ X4 @ nil ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',test) ).
thf(ax2,axiom,
! [X1: $i > $i,X2: $i,X3: $i] :
( ( map @ X1 @ ( cons @ X2 @ X3 ) )
= ( cons @ ( X1 @ X2 ) @ ( map @ X1 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2) ).
thf(ax1,axiom,
! [X1: $i > $i] :
( ( map @ X1 @ nil )
= nil ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1) ).
thf(c_0_3,negated_conjecture,
~ ! [X4: $i] :
( ( map
@ ^ [Z0: $i] : Z0
@ ( cons @ X4 @ nil ) )
= ( cons @ X4 @ nil ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[test])]) ).
thf(c_0_4,plain,
! [X11: $i > $i,X12: $i,X13: $i] :
( ( map @ X11 @ ( cons @ X12 @ X13 ) )
= ( cons @ ( X11 @ X12 ) @ ( map @ X11 @ X13 ) ) ),
inference(variable_rename,[status(thm)],[ax2]) ).
thf(c_0_5,plain,
! [X14: $i > $i] :
( ( map @ X14 @ nil )
= nil ),
inference(variable_rename,[status(thm)],[ax1]) ).
thf(c_0_6,negated_conjecture,
( ( map
@ ^ [Z0: $i] : Z0
@ ( cons @ esk1_0 @ nil ) )
!= ( cons @ esk1_0 @ nil ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
thf(c_0_7,plain,
! [X1: $i > $i,X2: $i,X3: $i] :
( ( map @ X1 @ ( cons @ X2 @ X3 ) )
= ( cons @ ( X1 @ X2 ) @ ( map @ X1 @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_8,plain,
! [X1: $i > $i] :
( ( map @ X1 @ nil )
= nil ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_9,negated_conjecture,
( ( map
@ ^ [Z0: $i] : Z0
@ ( cons @ esk1_0 @ nil ) )
!= ( cons @ esk1_0 @ nil ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_10,plain,
! [X1: $i > $i,X2: $i] :
( ( map @ X1 @ ( cons @ X2 @ nil ) )
= ( cons @ ( X1 @ X2 ) @ nil ) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_11,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_9,c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SWV447^1 : TPTP v8.2.0. Released v3.7.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n018.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Sun May 19 06:33:23 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.22/0.49 Running higher-order theorem proving
% 0.22/0.49 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.22/0.51 # Version: 3.1.0-ho
% 0.22/0.51 # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.22/0.51 # Starting post_as_ho10 with 300s (1) cores
% 0.22/0.51 # Starting new_bool_9 with 300s (1) cores
% 0.22/0.51 # Starting sh5l with 300s (1) cores
% 0.22/0.51 # new_bool_9 with pid 27085 completed with status 0
% 0.22/0.51 # Result found by new_bool_9
% 0.22/0.51 # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.22/0.51 # Starting post_as_ho10 with 300s (1) cores
% 0.22/0.51 # Starting new_bool_9 with 300s (1) cores
% 0.22/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.22/0.51 # Search class: HUUPS-FFSF22-SSSFFFNN
% 0.22/0.51 # partial match(2): HUUPS-FFSF22-SFFFFFNN
% 0.22/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.51 # Starting new_ho_10 with 181s (1) cores
% 0.22/0.51 # new_ho_10 with pid 27089 completed with status 0
% 0.22/0.51 # Result found by new_ho_10
% 0.22/0.51 # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.22/0.51 # Starting post_as_ho10 with 300s (1) cores
% 0.22/0.51 # Starting new_bool_9 with 300s (1) cores
% 0.22/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.22/0.51 # Search class: HUUPS-FFSF22-SSSFFFNN
% 0.22/0.51 # partial match(2): HUUPS-FFSF22-SFFFFFNN
% 0.22/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.51 # Starting new_ho_10 with 181s (1) cores
% 0.22/0.51 # Preprocessing time : 0.001 s
% 0.22/0.51 # Presaturation interreduction done
% 0.22/0.51
% 0.22/0.51 # Proof found!
% 0.22/0.51 # SZS status Theorem
% 0.22/0.51 # SZS output start CNFRefutation
% See solution above
% 0.22/0.51 # Parsed axioms : 6
% 0.22/0.51 # Removed by relevancy pruning/SinE : 3
% 0.22/0.51 # Initial clauses : 3
% 0.22/0.51 # Removed in clause preprocessing : 0
% 0.22/0.51 # Initial clauses in saturation : 3
% 0.22/0.51 # Processed clauses : 7
% 0.22/0.51 # ...of these trivial : 0
% 0.22/0.51 # ...subsumed : 0
% 0.22/0.51 # ...remaining for further processing : 7
% 0.22/0.51 # Other redundant clauses eliminated : 0
% 0.22/0.51 # Clauses deleted for lack of memory : 0
% 0.22/0.51 # Backward-subsumed : 0
% 0.22/0.51 # Backward-rewritten : 0
% 0.22/0.51 # Generated clauses : 6
% 0.22/0.51 # ...of the previous two non-redundant : 4
% 0.22/0.51 # ...aggressively subsumed : 0
% 0.22/0.51 # Contextual simplify-reflections : 0
% 0.22/0.51 # Paramodulations : 6
% 0.22/0.51 # Factorizations : 0
% 0.22/0.51 # NegExts : 0
% 0.22/0.51 # Equation resolutions : 0
% 0.22/0.51 # Disequality decompositions : 0
% 0.22/0.51 # Total rewrite steps : 0
% 0.22/0.51 # ...of those cached : 0
% 0.22/0.51 # Propositional unsat checks : 0
% 0.22/0.51 # Propositional check models : 0
% 0.22/0.51 # Propositional check unsatisfiable : 0
% 0.22/0.51 # Propositional clauses : 0
% 0.22/0.51 # Propositional clauses after purity: 0
% 0.22/0.51 # Propositional unsat core size : 0
% 0.22/0.51 # Propositional preprocessing time : 0.000
% 0.22/0.51 # Propositional encoding time : 0.000
% 0.22/0.51 # Propositional solver time : 0.000
% 0.22/0.51 # Success case prop preproc time : 0.000
% 0.22/0.51 # Success case prop encoding time : 0.000
% 0.22/0.51 # Success case prop solver time : 0.000
% 0.22/0.51 # Current number of processed clauses : 4
% 0.22/0.51 # Positive orientable unit clauses : 3
% 0.22/0.51 # Positive unorientable unit clauses: 0
% 0.22/0.51 # Negative unit clauses : 1
% 0.22/0.51 # Non-unit-clauses : 0
% 0.22/0.51 # Current number of unprocessed clauses: 2
% 0.22/0.51 # ...number of literals in the above : 2
% 0.22/0.51 # Current number of archived formulas : 0
% 0.22/0.51 # Current number of archived clauses : 3
% 0.22/0.51 # Clause-clause subsumption calls (NU) : 0
% 0.22/0.51 # Rec. Clause-clause subsumption calls : 0
% 0.22/0.51 # Non-unit clause-clause subsumptions : 0
% 0.22/0.51 # Unit Clause-clause subsumption calls : 0
% 0.22/0.51 # Rewrite failures with RHS unbound : 0
% 0.22/0.51 # BW rewrite match attempts : 1
% 0.22/0.51 # BW rewrite match successes : 0
% 0.22/0.51 # Condensation attempts : 7
% 0.22/0.51 # Condensation successes : 0
% 0.22/0.51 # Termbank termtop insertions : 294
% 0.22/0.51 # Search garbage collected termcells : 32
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.003 s
% 0.22/0.51 # System time : 0.002 s
% 0.22/0.51 # Total time : 0.005 s
% 0.22/0.51 # Maximum resident set size: 1808 pages
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.004 s
% 0.22/0.51 # System time : 0.004 s
% 0.22/0.51 # Total time : 0.008 s
% 0.22/0.51 # Maximum resident set size: 1724 pages
% 0.22/0.51 % E---3.1 exiting
% 0.22/0.51 % E exiting
%------------------------------------------------------------------------------