TSTP Solution File: SYN563-10 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYN563-10 : TPTP v8.1.2. Released v7.5.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 20:17:49 EDT 2023
% Result : Unsatisfiable 2.86s 0.84s
% Output : CNFRefutation 2.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 15
% Syntax : Number of clauses : 44 ( 44 unt; 0 nHn; 15 RR)
% Number of literals : 44 ( 43 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-4 aty)
% Number of variables : 61 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(p6_16,negated_conjecture,
ifeq2(p2(X1,X2),true,ifeq2(p2(X3,X4),true,ifeq2(p6(X3,X1),true,p6(X4,X2),true),true),true) = true,
file('/export/starexec/sandbox2/tmp/tmp.t8LlLKbenv/E---3.1_9534.p',p6_16) ).
cnf(p6_2,negated_conjecture,
p6(X1,X1) = true,
file('/export/starexec/sandbox2/tmp/tmp.t8LlLKbenv/E---3.1_9534.p',p6_2) ).
cnf(ifeq_axiom,axiom,
ifeq2(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/tmp/tmp.t8LlLKbenv/E---3.1_9534.p',ifeq_axiom) ).
cnf(p6_10,negated_conjecture,
ifeq2(p5(X1,X2),true,p6(f4(X1),X2),true) = true,
file('/export/starexec/sandbox2/tmp/tmp.t8LlLKbenv/E---3.1_9534.p',p6_10) ).
cnf(p5_7,negated_conjecture,
p5(f3(f3(X1)),f3(f4(X1))) = true,
file('/export/starexec/sandbox2/tmp/tmp.t8LlLKbenv/E---3.1_9534.p',p5_7) ).
cnf(p2_1,negated_conjecture,
p2(X1,X1) = true,
file('/export/starexec/sandbox2/tmp/tmp.t8LlLKbenv/E---3.1_9534.p',p2_1) ).
cnf(p2_11,negated_conjecture,
ifeq2(p2(X1,X2),true,p2(f3(X1),f3(X2)),true) = true,
file('/export/starexec/sandbox2/tmp/tmp.t8LlLKbenv/E---3.1_9534.p',p2_11) ).
cnf(p2_4,negated_conjecture,
p2(f4(c7),f4(c8)) = true,
file('/export/starexec/sandbox2/tmp/tmp.t8LlLKbenv/E---3.1_9534.p',p2_4) ).
cnf(p6_9,negated_conjecture,
ifeq2(p6(c7,X1),true,p6(c7,f3(X1)),true) = true,
file('/export/starexec/sandbox2/tmp/tmp.t8LlLKbenv/E---3.1_9534.p',p6_9) ).
cnf(p6_14,negated_conjecture,
ifeq2(p6(X1,X2),true,ifeq2(p6(X3,X1),true,p6(X3,X2),true),true) = true,
file('/export/starexec/sandbox2/tmp/tmp.t8LlLKbenv/E---3.1_9534.p',p6_14) ).
cnf(p5_15,negated_conjecture,
ifeq2(p6(X1,X2),true,ifeq2(p5(X2,X3),true,p5(X1,X3),true),true) = true,
file('/export/starexec/sandbox2/tmp/tmp.t8LlLKbenv/E---3.1_9534.p',p5_15) ).
cnf(p5_8,negated_conjecture,
ifeq2(p6(f4(X1),X2),true,p5(X1,X2),true) = true,
file('/export/starexec/sandbox2/tmp/tmp.t8LlLKbenv/E---3.1_9534.p',p5_8) ).
cnf(not_p6_5,negated_conjecture,
ifeq(p6(f4(c7),f3(f4(c8))),true,a,b) = b,
file('/export/starexec/sandbox2/tmp/tmp.t8LlLKbenv/E---3.1_9534.p',not_p6_5) ).
cnf(ifeq_axiom_001,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/tmp/tmp.t8LlLKbenv/E---3.1_9534.p',ifeq_axiom_001) ).
cnf(goal,negated_conjecture,
a != b,
file('/export/starexec/sandbox2/tmp/tmp.t8LlLKbenv/E---3.1_9534.p',goal) ).
cnf(c_0_15,negated_conjecture,
ifeq2(p2(X1,X2),true,ifeq2(p2(X3,X4),true,ifeq2(p6(X3,X1),true,p6(X4,X2),true),true),true) = true,
p6_16 ).
cnf(c_0_16,negated_conjecture,
p6(X1,X1) = true,
p6_2 ).
cnf(c_0_17,axiom,
ifeq2(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_18,negated_conjecture,
ifeq2(p5(X1,X2),true,p6(f4(X1),X2),true) = true,
p6_10 ).
cnf(c_0_19,negated_conjecture,
p5(f3(f3(X1)),f3(f4(X1))) = true,
p5_7 ).
cnf(c_0_20,negated_conjecture,
ifeq2(p2(X1,X2),true,ifeq2(p2(X1,X3),true,p6(X3,X2),true),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_21,negated_conjecture,
p2(X1,X1) = true,
p2_1 ).
cnf(c_0_22,negated_conjecture,
ifeq2(p2(X1,X2),true,p2(f3(X1),f3(X2)),true) = true,
p2_11 ).
cnf(c_0_23,negated_conjecture,
p2(f4(c7),f4(c8)) = true,
p2_4 ).
cnf(c_0_24,negated_conjecture,
ifeq2(p6(c7,X1),true,p6(c7,f3(X1)),true) = true,
p6_9 ).
cnf(c_0_25,negated_conjecture,
ifeq2(p6(X1,X2),true,ifeq2(p6(X3,X1),true,p6(X3,X2),true),true) = true,
p6_14 ).
cnf(c_0_26,negated_conjecture,
p6(f4(f3(f3(X1))),f3(f4(X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_17]) ).
cnf(c_0_27,negated_conjecture,
ifeq2(p2(X1,X2),true,p6(X1,X2),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_17]) ).
cnf(c_0_28,negated_conjecture,
p2(f3(f4(c7)),f3(f4(c8))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_17]) ).
cnf(c_0_29,negated_conjecture,
p6(c7,f3(c7)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_16]),c_0_17]) ).
cnf(c_0_30,negated_conjecture,
ifeq2(p6(f3(f4(X1)),X2),true,p6(f4(f3(f3(X1))),X2),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_17]) ).
cnf(c_0_31,negated_conjecture,
p6(f3(f4(c7)),f3(f4(c8))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_17]) ).
cnf(c_0_32,negated_conjecture,
ifeq2(p6(X1,X2),true,ifeq2(p5(X2,X3),true,p5(X1,X3),true),true) = true,
p5_15 ).
cnf(c_0_33,negated_conjecture,
p6(c7,f3(f3(c7))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_29]),c_0_17]) ).
cnf(c_0_34,negated_conjecture,
ifeq2(p6(f4(X1),X2),true,p5(X1,X2),true) = true,
p5_8 ).
cnf(c_0_35,negated_conjecture,
p6(f4(f3(f3(c7))),f3(f4(c8))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_17]) ).
cnf(c_0_36,negated_conjecture,
ifeq2(p5(f3(f3(c7)),X1),true,p5(c7,X1),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_17]) ).
cnf(c_0_37,negated_conjecture,
p5(f3(f3(c7)),f3(f4(c8))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_17]) ).
cnf(c_0_38,negated_conjecture,
p5(c7,f3(f4(c8))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_17]) ).
cnf(c_0_39,negated_conjecture,
ifeq(p6(f4(c7),f3(f4(c8))),true,a,b) = b,
not_p6_5 ).
cnf(c_0_40,negated_conjecture,
p6(f4(c7),f3(f4(c8))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_38]),c_0_17]) ).
cnf(c_0_41,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom_001 ).
cnf(c_0_42,negated_conjecture,
a != b,
goal ).
cnf(c_0_43,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40]),c_0_41]),c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYN563-10 : TPTP v8.1.2. Released v7.5.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n029.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 2400
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon Oct 2 18:25:07 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.22/0.50 Running first-order theorem proving
% 0.22/0.50 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/tmp/tmp.t8LlLKbenv/E---3.1_9534.p
% 2.86/0.84 # Version: 3.1pre001
% 2.86/0.84 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.86/0.84 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.86/0.84 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.86/0.84 # Starting new_bool_3 with 300s (1) cores
% 2.86/0.84 # Starting new_bool_1 with 300s (1) cores
% 2.86/0.84 # Starting sh5l with 300s (1) cores
% 2.86/0.84 # new_bool_1 with pid 9660 completed with status 0
% 2.86/0.84 # Result found by new_bool_1
% 2.86/0.84 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.86/0.84 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.86/0.84 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.86/0.84 # Starting new_bool_3 with 300s (1) cores
% 2.86/0.84 # Starting new_bool_1 with 300s (1) cores
% 2.86/0.84 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.86/0.84 # Search class: FUUPM-FFMS32-MFFFFFNN
% 2.86/0.84 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.86/0.84 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 150s (1) cores
% 2.86/0.84 # G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with pid 9666 completed with status 0
% 2.86/0.84 # Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN
% 2.86/0.84 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.86/0.84 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.86/0.84 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.86/0.84 # Starting new_bool_3 with 300s (1) cores
% 2.86/0.84 # Starting new_bool_1 with 300s (1) cores
% 2.86/0.84 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.86/0.84 # Search class: FUUPM-FFMS32-MFFFFFNN
% 2.86/0.84 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.86/0.84 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 150s (1) cores
% 2.86/0.84 # Preprocessing time : 0.087 s
% 2.86/0.84
% 2.86/0.84 # Proof found!
% 2.86/0.84 # SZS status Unsatisfiable
% 2.86/0.84 # SZS output start CNFRefutation
% See solution above
% 2.86/0.84 # Parsed axioms : 20
% 2.86/0.84 # Removed by relevancy pruning/SinE : 0
% 2.86/0.84 # Initial clauses : 20
% 2.86/0.84 # Removed in clause preprocessing : 0
% 2.86/0.84 # Initial clauses in saturation : 20
% 2.86/0.84 # Processed clauses : 633
% 2.86/0.84 # ...of these trivial : 167
% 2.86/0.84 # ...subsumed : 0
% 2.86/0.84 # ...remaining for further processing : 466
% 2.86/0.84 # Other redundant clauses eliminated : 0
% 2.86/0.84 # Clauses deleted for lack of memory : 0
% 2.86/0.84 # Backward-subsumed : 0
% 2.86/0.84 # Backward-rewritten : 5
% 2.86/0.84 # Generated clauses : 16807
% 2.86/0.84 # ...of the previous two non-redundant : 14868
% 2.86/0.84 # ...aggressively subsumed : 0
% 2.86/0.84 # Contextual simplify-reflections : 0
% 2.86/0.84 # Paramodulations : 16807
% 2.86/0.84 # Factorizations : 0
% 2.86/0.84 # NegExts : 0
% 2.86/0.84 # Equation resolutions : 0
% 2.86/0.84 # Total rewrite steps : 16458
% 2.86/0.84 # Propositional unsat checks : 0
% 2.86/0.84 # Propositional check models : 0
% 2.86/0.84 # Propositional check unsatisfiable : 0
% 2.86/0.84 # Propositional clauses : 0
% 2.86/0.84 # Propositional clauses after purity: 0
% 2.86/0.84 # Propositional unsat core size : 0
% 2.86/0.84 # Propositional preprocessing time : 0.000
% 2.86/0.84 # Propositional encoding time : 0.000
% 2.86/0.84 # Propositional solver time : 0.000
% 2.86/0.84 # Success case prop preproc time : 0.000
% 2.86/0.84 # Success case prop encoding time : 0.000
% 2.86/0.84 # Success case prop solver time : 0.000
% 2.86/0.84 # Current number of processed clauses : 461
% 2.86/0.84 # Positive orientable unit clauses : 460
% 2.86/0.84 # Positive unorientable unit clauses: 0
% 2.86/0.84 # Negative unit clauses : 1
% 2.86/0.84 # Non-unit-clauses : 0
% 2.86/0.84 # Current number of unprocessed clauses: 14254
% 2.86/0.84 # ...number of literals in the above : 14254
% 2.86/0.84 # Current number of archived formulas : 0
% 2.86/0.84 # Current number of archived clauses : 5
% 2.86/0.84 # Clause-clause subsumption calls (NU) : 0
% 2.86/0.84 # Rec. Clause-clause subsumption calls : 0
% 2.86/0.84 # Non-unit clause-clause subsumptions : 0
% 2.86/0.84 # Unit Clause-clause subsumption calls : 0
% 2.86/0.84 # Rewrite failures with RHS unbound : 0
% 2.86/0.84 # BW rewrite match attempts : 4350
% 2.86/0.84 # BW rewrite match successes : 5
% 2.86/0.84 # Condensation attempts : 0
% 2.86/0.84 # Condensation successes : 0
% 2.86/0.84 # Termbank termtop insertions : 312138
% 2.86/0.84
% 2.86/0.84 # -------------------------------------------------
% 2.86/0.84 # User time : 0.299 s
% 2.86/0.84 # System time : 0.018 s
% 2.86/0.84 # Total time : 0.317 s
% 2.86/0.84 # Maximum resident set size: 1628 pages
% 2.86/0.84
% 2.86/0.84 # -------------------------------------------------
% 2.86/0.84 # User time : 0.302 s
% 2.86/0.84 # System time : 0.020 s
% 2.86/0.84 # Total time : 0.322 s
% 2.86/0.84 # Maximum resident set size: 1680 pages
% 2.86/0.84 % E---3.1 exiting
% 2.86/0.84 % E---3.1 exiting
%------------------------------------------------------------------------------