TSTP Solution File: NUM662_8 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM662_8 : TPTP v8.2.0. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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:15:23 EDT 2024
% Result : Theorem 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of formulae : 25 ( 18 unt; 7 typ; 0 def)
% Number of atoms : 18 ( 17 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 16 ( 16 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 1 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 19 ( 0 sgn 19 !; 0 ?; 19 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
nat: $tType ).
tff(decl_22,type,
x: nat ).
tff(decl_23,type,
y: nat ).
tff(decl_24,type,
z: nat ).
tff(decl_25,type,
pl: ( nat * nat ) > nat ).
tff(decl_26,type,
esk1_0: nat ).
tff(decl_27,type,
esk2_0: nat ).
tff(l,axiom,
~ ! [X1: nat] : ( y != pl(x,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l) ).
tff(satz15,conjecture,
~ ! [X1: nat] : ( z != pl(x,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz15) ).
tff(satz5,axiom,
! [X2: nat,X4: nat,X5: nat] : ( pl(pl(X2,X4),X5) = pl(X2,pl(X4,X5)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz5) ).
tff(k,axiom,
~ ! [X2: nat] : ( z != pl(y,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',k) ).
tff(c_0_4,plain,
~ ! [X1: nat] : ( y != pl(x,X1) ),
inference(fof_simplification,[status(thm)],[l]) ).
tff(c_0_5,negated_conjecture,
~ ~ ! [X1: nat] : ( z != pl(x,X1) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz15])]) ).
tff(c_0_6,plain,
! [X7: nat,X8: nat,X9: nat] : ( pl(pl(X7,X8),X9) = pl(X7,pl(X8,X9)) ),
inference(variable_rename,[status(thm)],[satz5]) ).
tff(c_0_7,plain,
y = pl(x,esk1_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
tff(c_0_8,plain,
~ ! [X2: nat] : ( z != pl(y,X2) ),
inference(fof_simplification,[status(thm)],[k]) ).
tff(c_0_9,negated_conjecture,
! [X6: nat] : ( z != pl(x,X6) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
tcf(c_0_10,plain,
! [X1: nat,X2: nat,X4: nat] : pl(pl(X1,X2),X4) = pl(X1,pl(X2,X4)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
tcf(c_0_11,plain,
y = pl(x,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tff(c_0_12,plain,
z = pl(y,esk2_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
tcf(c_0_13,negated_conjecture,
! [X1: nat] : z != pl(x,X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
tcf(c_0_14,plain,
! [X1: nat] : pl(x,pl(esk1_0,X1)) = pl(y,X1),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
tcf(c_0_15,plain,
z = pl(y,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
tcf(c_0_16,negated_conjecture,
! [X1: nat] : pl(y,X1) != z,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
$false,
inference(sr,[status(thm)],[c_0_15,c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.14/0.13 % Problem : NUM662_8 : TPTP v8.2.0. Released v8.0.0.
% 0.14/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n012.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.35 % DateTime : Mon May 20 03:49:38 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox2/solver/bin/eprover --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.21/0.50 # Version: 3.1.0
% 0.21/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # new_bool_3 with pid 21162 completed with status 0
% 0.21/0.50 # Result found by new_bool_3
% 0.21/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.50 # Search class: FUUPF-FFSF22-SFFFFFNN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.50 # SAT001_MinMin_p005000_rr_RG with pid 21168 completed with status 0
% 0.21/0.50 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.50 # Search class: FUUPF-FFSF22-SFFFFFNN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.50 # Preprocessing time : 0.001 s
% 0.21/0.50 # Presaturation interreduction done
% 0.21/0.50
% 0.21/0.50 # Proof found!
% 0.21/0.50 # SZS status Theorem
% 0.21/0.50 # SZS output start CNFRefutation
% See solution above
% 0.21/0.50 # Parsed axioms : 10
% 0.21/0.50 # Removed by relevancy pruning/SinE : 6
% 0.21/0.50 # Initial clauses : 4
% 0.21/0.50 # Removed in clause preprocessing : 0
% 0.21/0.50 # Initial clauses in saturation : 4
% 0.21/0.50 # Processed clauses : 12
% 0.21/0.50 # ...of these trivial : 0
% 0.21/0.50 # ...subsumed : 0
% 0.21/0.50 # ...remaining for further processing : 12
% 0.21/0.50 # Other redundant clauses eliminated : 0
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 0
% 0.21/0.50 # Backward-rewritten : 0
% 0.21/0.50 # Generated clauses : 9
% 0.21/0.50 # ...of the previous two non-redundant : 4
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 0
% 0.21/0.50 # Paramodulations : 8
% 0.21/0.50 # Factorizations : 0
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 0
% 0.21/0.50 # Disequality decompositions : 0
% 0.21/0.50 # Total rewrite steps : 9
% 0.21/0.50 # ...of those cached : 0
% 0.21/0.50 # Propositional unsat checks : 0
% 0.21/0.50 # Propositional check models : 0
% 0.21/0.50 # Propositional check unsatisfiable : 0
% 0.21/0.50 # Propositional clauses : 0
% 0.21/0.50 # Propositional clauses after purity: 0
% 0.21/0.50 # Propositional unsat core size : 0
% 0.21/0.50 # Propositional preprocessing time : 0.000
% 0.21/0.50 # Propositional encoding time : 0.000
% 0.21/0.50 # Propositional solver time : 0.000
% 0.21/0.50 # Success case prop preproc time : 0.000
% 0.21/0.50 # Success case prop encoding time : 0.000
% 0.21/0.50 # Success case prop solver time : 0.000
% 0.21/0.50 # Current number of processed clauses : 7
% 0.21/0.50 # Positive orientable unit clauses : 4
% 0.21/0.50 # Positive unorientable unit clauses: 0
% 0.21/0.50 # Negative unit clauses : 3
% 0.21/0.50 # Non-unit-clauses : 0
% 0.21/0.50 # Current number of unprocessed clauses: 0
% 0.21/0.50 # ...number of literals in the above : 0
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 5
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 0
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 0
% 0.21/0.50 # Non-unit clause-clause subsumptions : 0
% 0.21/0.50 # Unit Clause-clause subsumption calls : 2
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 0
% 0.21/0.50 # BW rewrite match successes : 0
% 0.21/0.50 # Condensation attempts : 0
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 303
% 0.21/0.50 # Search garbage collected termcells : 36
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.002 s
% 0.21/0.50 # System time : 0.004 s
% 0.21/0.50 # Total time : 0.005 s
% 0.21/0.50 # Maximum resident set size: 1600 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.003 s
% 0.21/0.50 # System time : 0.006 s
% 0.21/0.50 # Total time : 0.009 s
% 0.21/0.50 # Maximum resident set size: 1708 pages
% 0.21/0.50 % E---3.1 exiting
% 0.21/0.50 % E exiting
%------------------------------------------------------------------------------