TSTP Solution File: GRP772-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GRP772-1 : TPTP v8.1.2. Released v4.1.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 : Sat May 4 08:02:13 EDT 2024
% Result : Unsatisfiable 1.33s 0.64s
% Output : CNFRefutation 1.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 18
% Syntax : Number of clauses : 62 ( 62 unt; 0 nHn; 4 RR)
% Number of literals : 62 ( 61 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-3 aty)
% Number of variables : 142 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(sos12,axiom,
eta(X1) = product(i(X1),X1),
file('/export/starexec/sandbox/tmp/tmp.HyLtYCZhTa/E---3.1_23659.p',sos12) ).
cnf(sos09,axiom,
i(X1) = difference(X1,one),
file('/export/starexec/sandbox/tmp/tmp.HyLtYCZhTa/E---3.1_23659.p',sos09) ).
cnf(sos13,axiom,
product(i(i(X1)),X2) = product(eta(X1),product(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.HyLtYCZhTa/E---3.1_23659.p',sos13) ).
cnf(sos11,axiom,
product(i(X1),X1) = product(X1,j(X1)),
file('/export/starexec/sandbox/tmp/tmp.HyLtYCZhTa/E---3.1_23659.p',sos11) ).
cnf(sos10,axiom,
j(X1) = quotient(one,X1),
file('/export/starexec/sandbox/tmp/tmp.HyLtYCZhTa/E---3.1_23659.p',sos10) ).
cnf(sos01,axiom,
product(X1,one) = X1,
file('/export/starexec/sandbox/tmp/tmp.HyLtYCZhTa/E---3.1_23659.p',sos01) ).
cnf(sos05,axiom,
quotient(product(X1,X2),X2) = X1,
file('/export/starexec/sandbox/tmp/tmp.HyLtYCZhTa/E---3.1_23659.p',sos05) ).
cnf(sos03,axiom,
product(X1,difference(X1,X2)) = X2,
file('/export/starexec/sandbox/tmp/tmp.HyLtYCZhTa/E---3.1_23659.p',sos03) ).
cnf(sos28,axiom,
product(product(X1,X2),a(X3,X4,X5)) = product(X1,product(X2,a(X3,X4,X5))),
file('/export/starexec/sandbox/tmp/tmp.HyLtYCZhTa/E---3.1_23659.p',sos28) ).
cnf(sos06,axiom,
product(quotient(X1,X2),X2) = X1,
file('/export/starexec/sandbox/tmp/tmp.HyLtYCZhTa/E---3.1_23659.p',sos06) ).
cnf(sos07,axiom,
difference(X1,product(product(X1,X2),X3)) = quotient(product(X2,product(X3,X1)),X1),
file('/export/starexec/sandbox/tmp/tmp.HyLtYCZhTa/E---3.1_23659.p',sos07) ).
cnf(sos04,axiom,
difference(X1,product(X1,X2)) = X2,
file('/export/starexec/sandbox/tmp/tmp.HyLtYCZhTa/E---3.1_23659.p',sos04) ).
cnf(sos29,axiom,
product(a(X1,X2,X3),difference(X3,product(a(X3,X1,X2),X3))) = one,
file('/export/starexec/sandbox/tmp/tmp.HyLtYCZhTa/E---3.1_23659.p',sos29) ).
cnf(sos27,axiom,
product(a(X1,X2,X3),product(X4,X5)) = product(product(a(X1,X2,X3),X4),X5),
file('/export/starexec/sandbox/tmp/tmp.HyLtYCZhTa/E---3.1_23659.p',sos27) ).
cnf(sos31,axiom,
a(i(X1),X2,X3) = a(j(X1),X2,X3),
file('/export/starexec/sandbox/tmp/tmp.HyLtYCZhTa/E---3.1_23659.p',sos31) ).
cnf(sos32,axiom,
a(j(X1),X2,X3) = a(X2,X3,X1),
file('/export/starexec/sandbox/tmp/tmp.HyLtYCZhTa/E---3.1_23659.p',sos32) ).
cnf(sos30,axiom,
a(X1,i(X2),X3) = a(X1,j(X2),X3),
file('/export/starexec/sandbox/tmp/tmp.HyLtYCZhTa/E---3.1_23659.p',sos30) ).
cnf(goals,negated_conjecture,
a(x0,x1,x1) != a(x1,x1,x0),
file('/export/starexec/sandbox/tmp/tmp.HyLtYCZhTa/E---3.1_23659.p',goals) ).
cnf(c_0_18,axiom,
eta(X1) = product(i(X1),X1),
sos12 ).
cnf(c_0_19,axiom,
i(X1) = difference(X1,one),
sos09 ).
cnf(c_0_20,axiom,
product(i(i(X1)),X2) = product(eta(X1),product(X1,X2)),
sos13 ).
cnf(c_0_21,plain,
eta(X1) = product(difference(X1,one),X1),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,axiom,
product(i(X1),X1) = product(X1,j(X1)),
sos11 ).
cnf(c_0_23,axiom,
j(X1) = quotient(one,X1),
sos10 ).
cnf(c_0_24,plain,
product(difference(difference(X1,one),one),X2) = product(product(difference(X1,one),X1),product(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_19]),c_0_19]),c_0_21]) ).
cnf(c_0_25,plain,
product(difference(X1,one),X1) = product(X1,quotient(one,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_19]),c_0_23]) ).
cnf(c_0_26,plain,
product(product(X1,quotient(one,X1)),product(X1,X2)) = product(difference(difference(X1,one),one),X2),
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,axiom,
product(X1,one) = X1,
sos01 ).
cnf(c_0_28,axiom,
quotient(product(X1,X2),X2) = X1,
sos05 ).
cnf(c_0_29,axiom,
product(X1,difference(X1,X2)) = X2,
sos03 ).
cnf(c_0_30,axiom,
product(product(X1,X2),a(X3,X4,X5)) = product(X1,product(X2,a(X3,X4,X5))),
sos28 ).
cnf(c_0_31,plain,
product(product(X1,quotient(one,X1)),X1) = difference(difference(X1,one),one),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_27]) ).
cnf(c_0_32,axiom,
product(quotient(X1,X2),X2) = X1,
sos06 ).
cnf(c_0_33,axiom,
difference(X1,product(product(X1,X2),X3)) = quotient(product(X2,product(X3,X1)),X1),
sos07 ).
cnf(c_0_34,plain,
quotient(X1,difference(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,plain,
difference(difference(a(X1,X2,X3),one),one) = a(X1,X2,X3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_27]) ).
cnf(c_0_36,axiom,
difference(X1,product(X1,X2)) = X2,
sos04 ).
cnf(c_0_37,axiom,
product(a(X1,X2,X3),difference(X3,product(a(X3,X1,X2),X3))) = one,
sos29 ).
cnf(c_0_38,plain,
difference(X1,product(product(X1,X2),quotient(X3,X1))) = quotient(product(X2,X3),X1),
inference(spm,[status(thm)],[c_0_33,c_0_32]) ).
cnf(c_0_39,plain,
quotient(one,a(X1,X2,X3)) = difference(a(X1,X2,X3),one),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,axiom,
product(a(X1,X2,X3),product(X4,X5)) = product(product(a(X1,X2,X3),X4),X5),
sos27 ).
cnf(c_0_41,axiom,
a(i(X1),X2,X3) = a(j(X1),X2,X3),
sos31 ).
cnf(c_0_42,axiom,
a(j(X1),X2,X3) = a(X2,X3,X1),
sos32 ).
cnf(c_0_43,plain,
difference(X1,product(a(X1,X2,X3),X1)) = difference(a(X2,X3,X1),one),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_44,plain,
product(X1,difference(a(X2,X3,X4),one)) = quotient(X1,a(X2,X3,X4)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),c_0_36]),c_0_27]) ).
cnf(c_0_45,axiom,
a(X1,i(X2),X3) = a(X1,j(X2),X3),
sos30 ).
cnf(c_0_46,plain,
a(quotient(one,X1),X2,X3) = a(difference(X1,one),X2,X3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_19]),c_0_23]) ).
cnf(c_0_47,plain,
a(quotient(one,X1),X2,X3) = a(X2,X3,X1),
inference(rw,[status(thm)],[c_0_42,c_0_23]) ).
cnf(c_0_48,plain,
quotient(X1,a(X2,X3,X1)) = product(a(X1,X2,X3),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_43]),c_0_44]) ).
cnf(c_0_49,plain,
a(X1,quotient(one,X2),X3) = a(X1,difference(X2,one),X3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_19]),c_0_23]) ).
cnf(c_0_50,plain,
a(difference(X1,one),X2,X3) = a(X2,X3,X1),
inference(rw,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_51,plain,
difference(quotient(X1,X2),X1) = X2,
inference(spm,[status(thm)],[c_0_36,c_0_32]) ).
cnf(c_0_52,plain,
product(a(X1,difference(X2,one),X3),X1) = quotient(X1,a(X3,X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_47]),c_0_49]) ).
cnf(c_0_53,plain,
a(X1,X2,quotient(one,X3)) = a(X3,X1,X2),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_54,plain,
a(X1,X2,difference(X3,one)) = a(X3,X1,X2),
inference(spm,[status(thm)],[c_0_47,c_0_34]) ).
cnf(c_0_55,plain,
quotient(X1,a(X1,X2,X3)) = product(a(X2,X3,X1),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]),c_0_47]) ).
cnf(c_0_56,negated_conjecture,
a(x0,x1,x1) != a(x1,x1,x0),
inference(fof_simplification,[status(thm)],[goals]) ).
cnf(c_0_57,plain,
difference(product(a(X1,X2,X3),X1),X1) = a(X2,X3,X1),
inference(spm,[status(thm)],[c_0_51,c_0_48]) ).
cnf(c_0_58,plain,
difference(product(a(X1,X2,X3),X3),X3) = a(X3,X1,X2),
inference(spm,[status(thm)],[c_0_51,c_0_55]) ).
cnf(c_0_59,negated_conjecture,
a(x0,x1,x1) != a(x1,x1,x0),
c_0_56 ).
cnf(c_0_60,plain,
a(X1,X1,X2) = a(X2,X1,X1),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_61,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_60])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP772-1 : TPTP v8.1.2. Released v4.1.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n018.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri May 3 16:19:08 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.47 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/tmp/tmp.HyLtYCZhTa/E---3.1_23659.p
% 1.33/0.64 # Version: 3.1.0
% 1.33/0.64 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.33/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.33/0.64 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.33/0.64 # Starting new_bool_3 with 300s (1) cores
% 1.33/0.64 # Starting new_bool_1 with 300s (1) cores
% 1.33/0.64 # Starting sh5l with 300s (1) cores
% 1.33/0.64 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 23778 completed with status 0
% 1.33/0.64 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.33/0.64 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.33/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.33/0.64 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.33/0.64 # No SInE strategy applied
% 1.33/0.64 # Search class: FUUPM-FFMF32-MFFFFFNN
% 1.33/0.64 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.33/0.64 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 583s (1) cores
% 1.33/0.64 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.33/0.64 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 1.33/0.64 # Starting G-E--_208_B02_F1_AE_CS_SP_PS_S0Y with 136s (1) cores
% 1.33/0.64 # Starting H----_042_B03_F1_AE_Q4_SP_S2S with 136s (1) cores
% 1.33/0.64 # G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with pid 23784 completed with status 0
% 1.33/0.64 # Result found by G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y
% 1.33/0.64 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.33/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.33/0.64 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.33/0.64 # No SInE strategy applied
% 1.33/0.64 # Search class: FUUPM-FFMF32-MFFFFFNN
% 1.33/0.64 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.33/0.64 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 583s (1) cores
% 1.33/0.64 # Preprocessing time : 0.001 s
% 1.33/0.64
% 1.33/0.64 # Proof found!
% 1.33/0.64 # SZS status Unsatisfiable
% 1.33/0.64 # SZS output start CNFRefutation
% See solution above
% 1.33/0.64 # Parsed axioms : 33
% 1.33/0.64 # Removed by relevancy pruning/SinE : 0
% 1.33/0.64 # Initial clauses : 33
% 1.33/0.64 # Removed in clause preprocessing : 4
% 1.33/0.64 # Initial clauses in saturation : 29
% 1.33/0.64 # Processed clauses : 603
% 1.33/0.64 # ...of these trivial : 272
% 1.33/0.64 # ...subsumed : 44
% 1.33/0.64 # ...remaining for further processing : 287
% 1.33/0.64 # Other redundant clauses eliminated : 0
% 1.33/0.64 # Clauses deleted for lack of memory : 0
% 1.33/0.64 # Backward-subsumed : 0
% 1.33/0.64 # Backward-rewritten : 84
% 1.33/0.64 # Generated clauses : 15695
% 1.33/0.64 # ...of the previous two non-redundant : 9734
% 1.33/0.64 # ...aggressively subsumed : 0
% 1.33/0.64 # Contextual simplify-reflections : 0
% 1.33/0.64 # Paramodulations : 15695
% 1.33/0.64 # Factorizations : 0
% 1.33/0.64 # NegExts : 0
% 1.33/0.64 # Equation resolutions : 0
% 1.33/0.64 # Disequality decompositions : 0
% 1.33/0.64 # Total rewrite steps : 40620
% 1.33/0.64 # ...of those cached : 36301
% 1.33/0.64 # Propositional unsat checks : 0
% 1.33/0.64 # Propositional check models : 0
% 1.33/0.64 # Propositional check unsatisfiable : 0
% 1.33/0.64 # Propositional clauses : 0
% 1.33/0.64 # Propositional clauses after purity: 0
% 1.33/0.64 # Propositional unsat core size : 0
% 1.33/0.64 # Propositional preprocessing time : 0.000
% 1.33/0.64 # Propositional encoding time : 0.000
% 1.33/0.64 # Propositional solver time : 0.000
% 1.33/0.64 # Success case prop preproc time : 0.000
% 1.33/0.64 # Success case prop encoding time : 0.000
% 1.33/0.64 # Success case prop solver time : 0.000
% 1.33/0.64 # Current number of processed clauses : 203
% 1.33/0.64 # Positive orientable unit clauses : 200
% 1.33/0.64 # Positive unorientable unit clauses: 3
% 1.33/0.64 # Negative unit clauses : 0
% 1.33/0.64 # Non-unit-clauses : 0
% 1.33/0.64 # Current number of unprocessed clauses: 8971
% 1.33/0.64 # ...number of literals in the above : 8971
% 1.33/0.64 # Current number of archived formulas : 0
% 1.33/0.64 # Current number of archived clauses : 88
% 1.33/0.64 # Clause-clause subsumption calls (NU) : 0
% 1.33/0.64 # Rec. Clause-clause subsumption calls : 0
% 1.33/0.64 # Non-unit clause-clause subsumptions : 0
% 1.33/0.64 # Unit Clause-clause subsumption calls : 38
% 1.33/0.64 # Rewrite failures with RHS unbound : 0
% 1.33/0.64 # BW rewrite match attempts : 475
% 1.33/0.64 # BW rewrite match successes : 80
% 1.33/0.64 # Condensation attempts : 0
% 1.33/0.64 # Condensation successes : 0
% 1.33/0.64 # Termbank termtop insertions : 245706
% 1.33/0.64 # Search garbage collected termcells : 2
% 1.33/0.64
% 1.33/0.64 # -------------------------------------------------
% 1.33/0.64 # User time : 0.140 s
% 1.33/0.64 # System time : 0.008 s
% 1.33/0.64 # Total time : 0.148 s
% 1.33/0.64 # Maximum resident set size: 1636 pages
% 1.33/0.64
% 1.33/0.64 # -------------------------------------------------
% 1.33/0.64 # User time : 0.677 s
% 1.33/0.64 # System time : 0.042 s
% 1.33/0.64 # Total time : 0.719 s
% 1.33/0.64 # Maximum resident set size: 1704 pages
% 1.33/0.64 % E---3.1 exiting
%------------------------------------------------------------------------------