TSTP Solution File: GRP206-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GRP206-1 : TPTP v8.2.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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:54:49 EDT 2024
% Result : Unsatisfiable 0.23s 0.53s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 12 ( 12 unt; 0 nHn; 5 RR)
% Number of literals : 12 ( 11 equ; 4 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 : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_moufang1,negated_conjecture,
multiply(multiply(a,multiply(b,c)),a) != multiply(multiply(a,b),multiply(c,a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_moufang1) ).
cnf(moufang4,axiom,
multiply(X1,multiply(multiply(X2,X3),X1)) = multiply(multiply(X1,X2),multiply(X3,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',moufang4) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_identity) ).
cnf(right_identity,axiom,
multiply(X1,identity) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_identity) ).
cnf(c_0_4,negated_conjecture,
multiply(multiply(a,multiply(b,c)),a) != multiply(multiply(a,b),multiply(c,a)),
inference(fof_simplification,[status(thm)],[prove_moufang1]) ).
cnf(c_0_5,negated_conjecture,
multiply(multiply(a,multiply(b,c)),a) != multiply(multiply(a,b),multiply(c,a)),
c_0_4 ).
cnf(c_0_6,axiom,
multiply(X1,multiply(multiply(X2,X3),X1)) = multiply(multiply(X1,X2),multiply(X3,X1)),
moufang4 ).
cnf(c_0_7,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_8,axiom,
multiply(X1,identity) = X1,
right_identity ).
cnf(c_0_9,negated_conjecture,
multiply(multiply(a,multiply(b,c)),a) != multiply(a,multiply(multiply(b,c),a)),
inference(rw,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_10,plain,
multiply(multiply(X1,X2),X1) = multiply(X1,multiply(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).
cnf(c_0_11,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : GRP206-1 : TPTP v8.2.0. Released v2.3.0.
% 0.13/0.15 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n002.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Sun May 19 04:45:38 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.23/0.52 Running first-order model finding
% 0.23/0.52 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.23/0.53 # Version: 3.1.0
% 0.23/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.53 # Starting sh5l with 300s (1) cores
% 0.23/0.53 # sh5l with pid 32036 completed with status 0
% 0.23/0.53 # Result found by sh5l
% 0.23/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.53 # Starting sh5l with 300s (1) cores
% 0.23/0.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.23/0.53 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.23/0.53 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.53 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 0.23/0.53 # H----_047_C09_12_F1_AE_ND_CS_SP_S2S with pid 32042 completed with status 0
% 0.23/0.53 # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S2S
% 0.23/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.53 # Starting sh5l with 300s (1) cores
% 0.23/0.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.23/0.53 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.23/0.53 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.53 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 0.23/0.53 # Preprocessing time : 0.001 s
% 0.23/0.53 # Presaturation interreduction done
% 0.23/0.53
% 0.23/0.53 # Proof found!
% 0.23/0.53 # SZS status Unsatisfiable
% 0.23/0.53 # SZS output start CNFRefutation
% See solution above
% 0.23/0.53 # Parsed axioms : 10
% 0.23/0.53 # Removed by relevancy pruning/SinE : 0
% 0.23/0.53 # Initial clauses : 10
% 0.23/0.53 # Removed in clause preprocessing : 0
% 0.23/0.53 # Initial clauses in saturation : 10
% 0.23/0.53 # Processed clauses : 34
% 0.23/0.53 # ...of these trivial : 0
% 0.23/0.53 # ...subsumed : 0
% 0.23/0.53 # ...remaining for further processing : 34
% 0.23/0.53 # Other redundant clauses eliminated : 0
% 0.23/0.53 # Clauses deleted for lack of memory : 0
% 0.23/0.53 # Backward-subsumed : 0
% 0.23/0.53 # Backward-rewritten : 2
% 0.23/0.53 # Generated clauses : 73
% 0.23/0.53 # ...of the previous two non-redundant : 26
% 0.23/0.53 # ...aggressively subsumed : 0
% 0.23/0.53 # Contextual simplify-reflections : 0
% 0.23/0.53 # Paramodulations : 73
% 0.23/0.53 # Factorizations : 0
% 0.23/0.53 # NegExts : 0
% 0.23/0.53 # Equation resolutions : 0
% 0.23/0.53 # Disequality decompositions : 0
% 0.23/0.53 # Total rewrite steps : 52
% 0.23/0.53 # ...of those cached : 22
% 0.23/0.53 # Propositional unsat checks : 0
% 0.23/0.53 # Propositional check models : 0
% 0.23/0.53 # Propositional check unsatisfiable : 0
% 0.23/0.53 # Propositional clauses : 0
% 0.23/0.53 # Propositional clauses after purity: 0
% 0.23/0.53 # Propositional unsat core size : 0
% 0.23/0.53 # Propositional preprocessing time : 0.000
% 0.23/0.53 # Propositional encoding time : 0.000
% 0.23/0.53 # Propositional solver time : 0.000
% 0.23/0.53 # Success case prop preproc time : 0.000
% 0.23/0.53 # Success case prop encoding time : 0.000
% 0.23/0.53 # Success case prop solver time : 0.000
% 0.23/0.53 # Current number of processed clauses : 22
% 0.23/0.53 # Positive orientable unit clauses : 22
% 0.23/0.53 # Positive unorientable unit clauses: 0
% 0.23/0.53 # Negative unit clauses : 0
% 0.23/0.53 # Non-unit-clauses : 0
% 0.23/0.53 # Current number of unprocessed clauses: 12
% 0.23/0.53 # ...number of literals in the above : 12
% 0.23/0.53 # Current number of archived formulas : 0
% 0.23/0.53 # Current number of archived clauses : 12
% 0.23/0.53 # Clause-clause subsumption calls (NU) : 0
% 0.23/0.53 # Rec. Clause-clause subsumption calls : 0
% 0.23/0.53 # Non-unit clause-clause subsumptions : 0
% 0.23/0.53 # Unit Clause-clause subsumption calls : 0
% 0.23/0.53 # Rewrite failures with RHS unbound : 0
% 0.23/0.53 # BW rewrite match attempts : 11
% 0.23/0.53 # BW rewrite match successes : 2
% 0.23/0.53 # Condensation attempts : 0
% 0.23/0.53 # Condensation successes : 0
% 0.23/0.53 # Termbank termtop insertions : 610
% 0.23/0.53 # Search garbage collected termcells : 2
% 0.23/0.53
% 0.23/0.53 # -------------------------------------------------
% 0.23/0.53 # User time : 0.003 s
% 0.23/0.53 # System time : 0.002 s
% 0.23/0.53 # Total time : 0.005 s
% 0.23/0.53 # Maximum resident set size: 1616 pages
% 0.23/0.53
% 0.23/0.53 # -------------------------------------------------
% 0.23/0.53 # User time : 0.003 s
% 0.23/0.53 # System time : 0.005 s
% 0.23/0.53 # Total time : 0.008 s
% 0.23/0.53 # Maximum resident set size: 1684 pages
% 0.23/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------