TSTP Solution File: GRP767-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP767-1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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 17:43:17 EDT 2023
% Result : Unsatisfiable 1.74s 0.66s
% Output : CNFRefutation 1.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of clauses : 34 ( 34 unt; 0 nHn; 4 RR)
% Number of literals : 34 ( 33 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 : 9 ( 9 usr; 3 con; 0-2 aty)
% Number of variables : 57 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(sos07,axiom,
difference(X1,product(product(X1,X2),X3)) = quotient(product(X2,product(X3,X1)),X1),
file('/export/starexec/sandbox/tmp/tmp.KwfoelMa8u/E---3.1_4781.p',sos07) ).
cnf(sos03,axiom,
product(X1,difference(X1,X2)) = X2,
file('/export/starexec/sandbox/tmp/tmp.KwfoelMa8u/E---3.1_4781.p',sos03) ).
cnf(sos06,axiom,
product(quotient(X1,X2),X2) = X1,
file('/export/starexec/sandbox/tmp/tmp.KwfoelMa8u/E---3.1_4781.p',sos06) ).
cnf(sos10,axiom,
j(X1) = quotient(one,X1),
file('/export/starexec/sandbox/tmp/tmp.KwfoelMa8u/E---3.1_4781.p',sos10) ).
cnf(sos12,axiom,
eta(X1) = product(i(X1),X1),
file('/export/starexec/sandbox/tmp/tmp.KwfoelMa8u/E---3.1_4781.p',sos12) ).
cnf(sos09,axiom,
i(X1) = difference(X1,one),
file('/export/starexec/sandbox/tmp/tmp.KwfoelMa8u/E---3.1_4781.p',sos09) ).
cnf(sos05,axiom,
quotient(product(X1,X2),X2) = X1,
file('/export/starexec/sandbox/tmp/tmp.KwfoelMa8u/E---3.1_4781.p',sos05) ).
cnf(sos16,axiom,
product(eta(X1),product(X2,X3)) = product(product(eta(X1),X2),X3),
file('/export/starexec/sandbox/tmp/tmp.KwfoelMa8u/E---3.1_4781.p',sos16) ).
cnf(sos01,axiom,
product(X1,one) = X1,
file('/export/starexec/sandbox/tmp/tmp.KwfoelMa8u/E---3.1_4781.p',sos01) ).
cnf(goals,negated_conjecture,
product(j(j(x0)),j(product(x1,x0))) != j(x1),
file('/export/starexec/sandbox/tmp/tmp.KwfoelMa8u/E---3.1_4781.p',goals) ).
cnf(sos14,axiom,
product(X1,product(eta(X1),X2)) = product(j(j(X1)),X2),
file('/export/starexec/sandbox/tmp/tmp.KwfoelMa8u/E---3.1_4781.p',sos14) ).
cnf(c_0_11,axiom,
difference(X1,product(product(X1,X2),X3)) = quotient(product(X2,product(X3,X1)),X1),
sos07 ).
cnf(c_0_12,axiom,
product(X1,difference(X1,X2)) = X2,
sos03 ).
cnf(c_0_13,axiom,
product(quotient(X1,X2),X2) = X1,
sos06 ).
cnf(c_0_14,plain,
quotient(product(difference(X1,X2),product(X3,X1)),X1) = difference(X1,product(X2,X3)),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,axiom,
j(X1) = quotient(one,X1),
sos10 ).
cnf(c_0_16,axiom,
eta(X1) = product(i(X1),X1),
sos12 ).
cnf(c_0_17,axiom,
i(X1) = difference(X1,one),
sos09 ).
cnf(c_0_18,plain,
product(difference(X1,product(X2,X3)),X1) = product(difference(X1,X2),product(X3,X1)),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
product(j(X1),X1) = one,
inference(spm,[status(thm)],[c_0_13,c_0_15]) ).
cnf(c_0_20,plain,
product(difference(X1,one),X1) = eta(X1),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,axiom,
quotient(product(X1,X2),X2) = X1,
sos05 ).
cnf(c_0_22,axiom,
product(eta(X1),product(X2,X3)) = product(product(eta(X1),X2),X3),
sos16 ).
cnf(c_0_23,plain,
product(difference(X1,j(X2)),product(X2,X1)) = eta(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_24,plain,
quotient(product(eta(X1),product(X2,X3)),X3) = product(eta(X1),X2),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,axiom,
product(X1,one) = X1,
sos01 ).
cnf(c_0_26,plain,
product(difference(X1,j(quotient(X2,X1))),X2) = eta(X1),
inference(spm,[status(thm)],[c_0_23,c_0_13]) ).
cnf(c_0_27,plain,
quotient(eta(X1),X2) = product(eta(X1),j(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_19]),c_0_25]) ).
cnf(c_0_28,negated_conjecture,
product(j(j(x0)),j(product(x1,x0))) != j(x1),
goals ).
cnf(c_0_29,axiom,
product(X1,product(eta(X1),X2)) = product(j(j(X1)),X2),
sos14 ).
cnf(c_0_30,plain,
difference(X1,j(quotient(X2,X1))) = product(eta(X1),j(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_26]),c_0_27]) ).
cnf(c_0_31,negated_conjecture,
product(x0,product(eta(x0),j(product(x1,x0)))) != j(x1),
inference(rw,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,plain,
product(X1,product(eta(X1),j(X2))) = j(quotient(X2,X1)),
inference(spm,[status(thm)],[c_0_12,c_0_30]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : GRP767-1 : TPTP v8.1.2. Released v4.1.0.
% 0.10/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n019.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 2400
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Tue Oct 3 02:38:06 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 0.17/0.43 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.KwfoelMa8u/E---3.1_4781.p
% 1.74/0.66 # Version: 3.1pre001
% 1.74/0.66 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.74/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.74/0.66 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.74/0.66 # Starting new_bool_3 with 300s (1) cores
% 1.74/0.66 # Starting new_bool_1 with 300s (1) cores
% 1.74/0.66 # Starting sh5l with 300s (1) cores
% 1.74/0.66 # sh5l with pid 4862 completed with status 0
% 1.74/0.66 # Result found by sh5l
% 1.74/0.66 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.74/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.74/0.66 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.74/0.66 # Starting new_bool_3 with 300s (1) cores
% 1.74/0.66 # Starting new_bool_1 with 300s (1) cores
% 1.74/0.66 # Starting sh5l with 300s (1) cores
% 1.74/0.66 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.74/0.66 # Search class: FUUPM-FFMF31-MFFFFFNN
% 1.74/0.66 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.74/0.66 # Starting H----_047_C18_F1_PI_AE_R8_CS_SP_S2S with 181s (1) cores
% 1.74/0.66 # H----_047_C18_F1_PI_AE_R8_CS_SP_S2S with pid 4870 completed with status 0
% 1.74/0.66 # Result found by H----_047_C18_F1_PI_AE_R8_CS_SP_S2S
% 1.74/0.66 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.74/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.74/0.66 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.74/0.66 # Starting new_bool_3 with 300s (1) cores
% 1.74/0.66 # Starting new_bool_1 with 300s (1) cores
% 1.74/0.66 # Starting sh5l with 300s (1) cores
% 1.74/0.66 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.74/0.66 # Search class: FUUPM-FFMF31-MFFFFFNN
% 1.74/0.66 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.74/0.66 # Starting H----_047_C18_F1_PI_AE_R8_CS_SP_S2S with 181s (1) cores
% 1.74/0.66 # Preprocessing time : 0.001 s
% 1.74/0.66
% 1.74/0.66 # Proof found!
% 1.74/0.66 # SZS status Unsatisfiable
% 1.74/0.66 # SZS output start CNFRefutation
% See solution above
% 1.74/0.66 # Parsed axioms : 21
% 1.74/0.66 # Removed by relevancy pruning/SinE : 0
% 1.74/0.66 # Initial clauses : 21
% 1.74/0.66 # Removed in clause preprocessing : 0
% 1.74/0.66 # Initial clauses in saturation : 21
% 1.74/0.66 # Processed clauses : 1111
% 1.74/0.66 # ...of these trivial : 473
% 1.74/0.66 # ...subsumed : 144
% 1.74/0.66 # ...remaining for further processing : 494
% 1.74/0.66 # Other redundant clauses eliminated : 0
% 1.74/0.66 # Clauses deleted for lack of memory : 0
% 1.74/0.66 # Backward-subsumed : 0
% 1.74/0.66 # Backward-rewritten : 175
% 1.74/0.66 # Generated clauses : 28872
% 1.74/0.66 # ...of the previous two non-redundant : 16423
% 1.74/0.66 # ...aggressively subsumed : 0
% 1.74/0.66 # Contextual simplify-reflections : 0
% 1.74/0.66 # Paramodulations : 28872
% 1.74/0.66 # Factorizations : 0
% 1.74/0.66 # NegExts : 0
% 1.74/0.66 # Equation resolutions : 0
% 1.74/0.66 # Total rewrite steps : 59414
% 1.74/0.66 # Propositional unsat checks : 0
% 1.74/0.66 # Propositional check models : 0
% 1.74/0.66 # Propositional check unsatisfiable : 0
% 1.74/0.66 # Propositional clauses : 0
% 1.74/0.66 # Propositional clauses after purity: 0
% 1.74/0.66 # Propositional unsat core size : 0
% 1.74/0.66 # Propositional preprocessing time : 0.000
% 1.74/0.66 # Propositional encoding time : 0.000
% 1.74/0.66 # Propositional solver time : 0.000
% 1.74/0.66 # Success case prop preproc time : 0.000
% 1.74/0.66 # Success case prop encoding time : 0.000
% 1.74/0.66 # Success case prop solver time : 0.000
% 1.74/0.66 # Current number of processed clauses : 319
% 1.74/0.66 # Positive orientable unit clauses : 307
% 1.74/0.66 # Positive unorientable unit clauses: 12
% 1.74/0.66 # Negative unit clauses : 0
% 1.74/0.66 # Non-unit-clauses : 0
% 1.74/0.66 # Current number of unprocessed clauses: 15178
% 1.74/0.66 # ...number of literals in the above : 15178
% 1.74/0.66 # Current number of archived formulas : 0
% 1.74/0.66 # Current number of archived clauses : 175
% 1.74/0.66 # Clause-clause subsumption calls (NU) : 0
% 1.74/0.66 # Rec. Clause-clause subsumption calls : 0
% 1.74/0.66 # Non-unit clause-clause subsumptions : 0
% 1.74/0.66 # Unit Clause-clause subsumption calls : 9
% 1.74/0.66 # Rewrite failures with RHS unbound : 0
% 1.74/0.66 # BW rewrite match attempts : 969
% 1.74/0.66 # BW rewrite match successes : 165
% 1.74/0.66 # Condensation attempts : 0
% 1.74/0.66 # Condensation successes : 0
% 1.74/0.66 # Termbank termtop insertions : 340058
% 1.74/0.66
% 1.74/0.66 # -------------------------------------------------
% 1.74/0.66 # User time : 0.190 s
% 1.74/0.66 # System time : 0.014 s
% 1.74/0.66 # Total time : 0.204 s
% 1.74/0.66 # Maximum resident set size: 1624 pages
% 1.74/0.66
% 1.74/0.66 # -------------------------------------------------
% 1.74/0.66 # User time : 0.191 s
% 1.74/0.66 # System time : 0.016 s
% 1.74/0.66 # Total time : 0.207 s
% 1.74/0.66 # Maximum resident set size: 1680 pages
% 1.74/0.66 % E---3.1 exiting
% 1.74/0.66 % E---3.1 exiting
%------------------------------------------------------------------------------