TSTP Solution File: NUM696_8 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : NUM696_8 : TPTP v8.2.0. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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 01:27:42 EDT 2024
% Result : Theorem 0.14s 0.41s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of formulae : 35 ( 15 unt; 8 typ; 0 def)
% Number of atoms : 39 ( 38 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 47 ( 35 ~; 5 |; 1 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 1 ( 1 usr)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-3 aty)
% Number of variables : 42 ( 0 sgn 42 !; 0 ?; 42 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
nat: $tType ).
tff(decl_22,type,
x: nat ).
tff(decl_23,type,
y: nat ).
tff(decl_24,type,
pl: ( nat * nat ) > nat ).
tff(decl_25,type,
n_1: nat ).
tff(decl_26,type,
esk1_3: ( nat * nat * nat ) > nat ).
tff(decl_27,type,
esk2_1: nat > nat ).
tff(decl_28,type,
esk3_0: nat ).
tff(satz25,conjecture,
( ~ ~ ! [X1: nat] : ( y != pl(pl(x,n_1),X1) )
=> ( y = pl(x,n_1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz25) ).
tff(satz19a,axiom,
! [X3: nat,X4: nat,X5: nat] :
( ~ ! [X1: nat] : ( X3 != pl(X4,X1) )
=> ~ ! [X1: nat] : ( pl(X3,X5) != pl(pl(X4,X5),X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz19a) ).
tff(satz6,axiom,
! [X3: nat,X4: nat] : ( pl(X3,X4) = pl(X4,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz6) ).
tff(satz24,axiom,
! [X3: nat] :
( ~ ~ ! [X1: nat] : ( X3 != pl(n_1,X1) )
=> ( X3 = n_1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz24) ).
tff(m,axiom,
~ ! [X1: nat] : ( y != pl(x,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m) ).
tff(c_0_5,negated_conjecture,
~ ( ~ ~ ! [X1: nat] : ( y != pl(pl(x,n_1),X1) )
=> ( y = pl(x,n_1) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz25])]) ).
tff(c_0_6,plain,
! [X3: nat,X4: nat,X5: nat] :
( ~ ! [X1: nat] : ( X3 != pl(X4,X1) )
=> ~ ! [X1: nat] : ( pl(X3,X5) != pl(pl(X4,X5),X1) ) ),
inference(fof_simplification,[status(thm)],[satz19a]) ).
tff(c_0_7,negated_conjecture,
! [X6: nat] :
( ( y != pl(pl(x,n_1),X6) )
& ( y != pl(x,n_1) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
tff(c_0_8,plain,
! [X12: nat,X13: nat] : ( pl(X12,X13) = pl(X13,X12) ),
inference(variable_rename,[status(thm)],[satz6]) ).
tff(c_0_9,plain,
! [X7: nat,X8: nat,X9: nat,X10: nat] :
( ( X7 != pl(X8,X9) )
| ( pl(X7,X10) = pl(pl(X8,X10),esk1_3(X7,X8,X10)) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])])]) ).
tcf(c_0_10,negated_conjecture,
! [X1: nat] : y != pl(pl(x,n_1),X1),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tcf(c_0_11,plain,
! [X3: nat,X1: nat] : pl(X1,X3) = pl(X3,X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tcf(c_0_12,plain,
! [X1: nat,X3: nat,X5: nat,X4: nat] :
( ( pl(X1,X5) = pl(pl(X3,X5),esk1_3(X1,X3,X5)) )
| ( X1 != pl(X3,X4) ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
tff(c_0_13,plain,
! [X3: nat] :
( ~ ~ ! [X1: nat] : ( X3 != pl(n_1,X1) )
=> ( X3 = n_1 ) ),
inference(fof_simplification,[status(thm)],[satz24]) ).
tcf(c_0_14,negated_conjecture,
! [X1: nat] : pl(pl(n_1,x),X1) != y,
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
tcf(c_0_15,plain,
! [X1: nat,X4: nat,X3: nat] : pl(pl(X1,X3),esk1_3(pl(X1,X4),X1,X3)) = pl(pl(X1,X4),X3),
inference(er,[status(thm)],[c_0_12]) ).
tff(c_0_16,plain,
! [X14: nat] :
( ( X14 = pl(n_1,esk2_1(X14)) )
| ( X14 = n_1 ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
tff(c_0_17,plain,
~ ! [X1: nat] : ( y != pl(x,X1) ),
inference(fof_simplification,[status(thm)],[m]) ).
tcf(c_0_18,negated_conjecture,
! [X1: nat] : pl(x,pl(n_1,X1)) != y,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_11]) ).
tcf(c_0_19,plain,
! [X1: nat] :
( ( X1 = pl(n_1,esk2_1(X1)) )
| ( X1 = n_1 ) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
tff(c_0_20,plain,
y = pl(x,esk3_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])]) ).
tcf(c_0_21,negated_conjecture,
! [X1: nat] :
( ( X1 = n_1 )
| ( pl(x,X1) != y ) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
tcf(c_0_22,plain,
y = pl(x,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
tcf(c_0_23,negated_conjecture,
y != pl(x,n_1),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tcf(c_0_24,negated_conjecture,
esk3_0 = n_1,
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
tcf(c_0_25,negated_conjecture,
pl(n_1,x) != y,
inference(rw,[status(thm)],[c_0_23,c_0_11]) ).
cnf(c_0_26,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_24]),c_0_11]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : NUM696_8 : TPTP v8.2.0. Released v8.0.0.
% 0.00/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n029.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Mon May 20 04:30:37 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.14/0.39 Running first-order model finding
% 0.14/0.40 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.41 # Version: 3.1.0
% 0.14/0.41 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.41 # Starting sh5l with 300s (1) cores
% 0.14/0.41 # new_bool_3 with pid 12987 completed with status 0
% 0.14/0.41 # Result found by new_bool_3
% 0.14/0.41 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.41 # Search class: FGUPF-FFSF32-SFFFFFNN
% 0.14/0.41 # partial match(1): FGUPF-FFSM32-SFFFFFNN
% 0.14/0.41 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.41 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.14/0.41 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 12990 completed with status 0
% 0.14/0.41 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.41 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.41 # Search class: FGUPF-FFSF32-SFFFFFNN
% 0.14/0.41 # partial match(1): FGUPF-FFSM32-SFFFFFNN
% 0.14/0.41 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.41 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.14/0.41 # Preprocessing time : 0.001 s
% 0.14/0.41 # Presaturation interreduction done
% 0.14/0.41
% 0.14/0.41 # Proof found!
% 0.14/0.41 # SZS status Theorem
% 0.14/0.41 # SZS output start CNFRefutation
% See solution above
% 0.14/0.41 # Parsed axioms : 11
% 0.14/0.41 # Removed by relevancy pruning/SinE : 6
% 0.14/0.41 # Initial clauses : 6
% 0.14/0.41 # Removed in clause preprocessing : 0
% 0.14/0.41 # Initial clauses in saturation : 6
% 0.14/0.41 # Processed clauses : 27
% 0.14/0.41 # ...of these trivial : 0
% 0.14/0.41 # ...subsumed : 6
% 0.14/0.41 # ...remaining for further processing : 21
% 0.14/0.41 # Other redundant clauses eliminated : 1
% 0.14/0.41 # Clauses deleted for lack of memory : 0
% 0.14/0.41 # Backward-subsumed : 0
% 0.14/0.41 # Backward-rewritten : 3
% 0.14/0.41 # Generated clauses : 29
% 0.14/0.41 # ...of the previous two non-redundant : 31
% 0.14/0.41 # ...aggressively subsumed : 0
% 0.14/0.41 # Contextual simplify-reflections : 0
% 0.14/0.41 # Paramodulations : 28
% 0.14/0.41 # Factorizations : 0
% 0.14/0.41 # NegExts : 0
% 0.14/0.41 # Equation resolutions : 1
% 0.14/0.41 # Disequality decompositions : 0
% 0.14/0.41 # Total rewrite steps : 5
% 0.14/0.41 # ...of those cached : 1
% 0.14/0.41 # Propositional unsat checks : 0
% 0.14/0.41 # Propositional check models : 0
% 0.14/0.41 # Propositional check unsatisfiable : 0
% 0.14/0.41 # Propositional clauses : 0
% 0.14/0.41 # Propositional clauses after purity: 0
% 0.14/0.41 # Propositional unsat core size : 0
% 0.14/0.41 # Propositional preprocessing time : 0.000
% 0.14/0.41 # Propositional encoding time : 0.000
% 0.14/0.41 # Propositional solver time : 0.000
% 0.14/0.41 # Success case prop preproc time : 0.000
% 0.14/0.41 # Success case prop encoding time : 0.000
% 0.14/0.41 # Success case prop solver time : 0.000
% 0.14/0.41 # Current number of processed clauses : 11
% 0.14/0.41 # Positive orientable unit clauses : 3
% 0.14/0.41 # Positive unorientable unit clauses: 1
% 0.14/0.41 # Negative unit clauses : 5
% 0.14/0.41 # Non-unit-clauses : 2
% 0.14/0.41 # Current number of unprocessed clauses: 16
% 0.14/0.41 # ...number of literals in the above : 20
% 0.14/0.41 # Current number of archived formulas : 0
% 0.14/0.41 # Current number of archived clauses : 9
% 0.14/0.41 # Clause-clause subsumption calls (NU) : 0
% 0.14/0.41 # Rec. Clause-clause subsumption calls : 0
% 0.14/0.41 # Non-unit clause-clause subsumptions : 0
% 0.14/0.41 # Unit Clause-clause subsumption calls : 7
% 0.14/0.41 # Rewrite failures with RHS unbound : 0
% 0.14/0.41 # BW rewrite match attempts : 17
% 0.14/0.41 # BW rewrite match successes : 17
% 0.14/0.41 # Condensation attempts : 0
% 0.14/0.41 # Condensation successes : 0
% 0.14/0.41 # Termbank termtop insertions : 703
% 0.14/0.41 # Search garbage collected termcells : 106
% 0.14/0.41
% 0.14/0.41 # -------------------------------------------------
% 0.14/0.41 # User time : 0.003 s
% 0.14/0.41 # System time : 0.002 s
% 0.14/0.41 # Total time : 0.005 s
% 0.14/0.41 # Maximum resident set size: 1792 pages
% 0.14/0.41
% 0.14/0.41 # -------------------------------------------------
% 0.14/0.41 # User time : 0.003 s
% 0.14/0.41 # System time : 0.004 s
% 0.14/0.41 # Total time : 0.007 s
% 0.14/0.41 # Maximum resident set size: 1708 pages
% 0.14/0.41 % E---3.1 exiting
%------------------------------------------------------------------------------