TSTP Solution File: GRP656-10 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GRP656-10 : TPTP v8.2.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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 : Mon May 20 20:58:33 EDT 2024
% Result : Unsatisfiable 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of clauses : 19 ( 19 unt; 0 nHn; 4 RR)
% Number of literals : 19 ( 18 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 0 con; 1-2 aty)
% Number of variables : 37 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(f04,axiom,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f04) ).
cnf(f05,axiom,
mult(mult(X1,X2),mult(X3,X1)) = mult(mult(X1,mult(X2,X3)),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).
cnf(f03,axiom,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f03) ).
cnf(f02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).
cnf(goal,negated_conjecture,
tuple(mult(X1,x1(X1)),mult(x1_2(X1),X1)) != tuple(x1(X1),x1_2(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).
cnf(c_0_5,axiom,
rd(mult(X1,X2),X2) = X1,
f04 ).
cnf(c_0_6,axiom,
mult(mult(X1,X2),mult(X3,X1)) = mult(mult(X1,mult(X2,X3)),X1),
f05 ).
cnf(c_0_7,plain,
rd(mult(mult(X1,X2),mult(X3,X1)),X1) = mult(X1,mult(X2,X3)),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,axiom,
mult(rd(X1,X2),X2) = X1,
f03 ).
cnf(c_0_9,plain,
rd(mult(mult(X1,X2),X3),X1) = mult(X1,mult(X2,rd(X3,X1))),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,axiom,
ld(X1,mult(X1,X2)) = X2,
f02 ).
cnf(c_0_11,plain,
mult(X1,mult(X2,rd(X1,X1))) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_5,c_0_9]) ).
cnf(c_0_12,plain,
mult(X1,rd(X2,X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_10]) ).
cnf(c_0_13,negated_conjecture,
tuple(mult(X1,x1(X1)),mult(x1_2(X1),X1)) != tuple(x1(X1),x1_2(X1)),
inference(fof_simplification,[status(thm)],[goal]) ).
cnf(c_0_14,plain,
ld(X1,X1) = rd(X2,X2),
inference(spm,[status(thm)],[c_0_10,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
tuple(mult(X1,x1(X1)),mult(x1_2(X1),X1)) != tuple(x1(X1),x1_2(X1)),
c_0_13 ).
cnf(c_0_16,plain,
mult(X1,ld(X2,X2)) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_14]) ).
cnf(c_0_17,plain,
mult(ld(X1,X1),X2) = X2,
inference(spm,[status(thm)],[c_0_8,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP656-10 : TPTP v8.2.0. Released v8.1.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n021.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 : Sun May 19 04:21:53 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.20/0.49 # Version: 3.1.0
% 0.20/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 18532 completed with status 0
% 0.20/0.49 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.20/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.20/0.49 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.49 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 0.20/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.20/0.49 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.20/0.49 # Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.20/0.49 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.20/0.49 # G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with pid 18541 completed with status 0
% 0.20/0.49 # Result found by G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y
% 0.20/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.20/0.49 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.49 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 0.20/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.20/0.49 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Unsatisfiable
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 6
% 0.20/0.49 # Removed by relevancy pruning/SinE : 0
% 0.20/0.49 # Initial clauses : 6
% 0.20/0.49 # Removed in clause preprocessing : 0
% 0.20/0.49 # Initial clauses in saturation : 6
% 0.20/0.49 # Processed clauses : 17
% 0.20/0.49 # ...of these trivial : 1
% 0.20/0.49 # ...subsumed : 0
% 0.20/0.49 # ...remaining for further processing : 16
% 0.20/0.49 # Other redundant clauses eliminated : 0
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 0
% 0.20/0.49 # Backward-rewritten : 2
% 0.20/0.49 # Generated clauses : 79
% 0.20/0.49 # ...of the previous two non-redundant : 56
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 0
% 0.20/0.49 # Paramodulations : 79
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 0
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 30
% 0.20/0.49 # ...of those cached : 10
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 14
% 0.20/0.49 # Positive orientable unit clauses : 12
% 0.20/0.49 # Positive unorientable unit clauses: 1
% 0.20/0.49 # Negative unit clauses : 1
% 0.20/0.49 # Non-unit-clauses : 0
% 0.20/0.49 # Current number of unprocessed clauses: 45
% 0.20/0.49 # ...number of literals in the above : 45
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 2
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.49 # Non-unit clause-clause subsumptions : 0
% 0.20/0.49 # Unit Clause-clause subsumption calls : 2
% 0.20/0.49 # Rewrite failures with RHS unbound : 5
% 0.20/0.49 # BW rewrite match attempts : 15
% 0.20/0.49 # BW rewrite match successes : 3
% 0.20/0.49 # Condensation attempts : 17
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 638
% 0.20/0.49 # Search garbage collected termcells : 2
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.003 s
% 0.20/0.49 # System time : 0.002 s
% 0.20/0.49 # Total time : 0.006 s
% 0.20/0.49 # Maximum resident set size: 1552 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.014 s
% 0.20/0.49 # System time : 0.011 s
% 0.20/0.49 # Total time : 0.025 s
% 0.20/0.49 # Maximum resident set size: 1684 pages
% 0.20/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------