TSTP Solution File: GRP520-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP520-1 : TPTP v8.1.2. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:49:21 EDT 2023
% Result : Unsatisfiable 0.15s 0.43s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 2
% Syntax : Number of clauses : 16 ( 16 unt; 0 nHn; 3 RR)
% Number of literals : 16 ( 15 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 38 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
multiply(X1,multiply(multiply(inverse(multiply(X1,X2)),X3),X2)) = X3,
file('/export/starexec/sandbox2/tmp/tmp.pmQ6Lkskt3/E---3.1_21993.p',single_axiom) ).
cnf(prove_these_axioms_4,negated_conjecture,
multiply(a,b) != multiply(b,a),
file('/export/starexec/sandbox2/tmp/tmp.pmQ6Lkskt3/E---3.1_21993.p',prove_these_axioms_4) ).
cnf(c_0_2,axiom,
multiply(X1,multiply(multiply(inverse(multiply(X1,X2)),X3),X2)) = X3,
single_axiom ).
cnf(c_0_3,plain,
multiply(X1,multiply(multiply(inverse(X2),X3),multiply(multiply(inverse(multiply(X1,X4)),X2),X4))) = X3,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
multiply(multiply(inverse(multiply(inverse(multiply(X1,X2)),X3)),X4),X3) = multiply(X1,multiply(X4,X2)),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_5,plain,
multiply(multiply(inverse(X1),X2),X1) = X2,
inference(spm,[status(thm)],[c_0_3,c_0_2]) ).
cnf(c_0_6,plain,
multiply(inverse(multiply(X1,X2)),multiply(X1,multiply(X3,X2))) = X3,
inference(spm,[status(thm)],[c_0_2,c_0_4]) ).
cnf(c_0_7,plain,
multiply(X1,multiply(X2,X3)) = multiply(X2,multiply(X1,X3)),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,plain,
multiply(multiply(inverse(multiply(inverse(multiply(X1,X2)),X3)),X4),multiply(multiply(inverse(multiply(X1,multiply(X4,X2))),X5),X3)) = X5,
inference(spm,[status(thm)],[c_0_2,c_0_4]) ).
cnf(c_0_9,plain,
multiply(X1,multiply(inverse(multiply(X1,X2)),multiply(X3,X2))) = X3,
inference(rw,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
multiply(multiply(inverse(X1),X1),X2) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_5]),c_0_7]),c_0_9]) ).
cnf(c_0_11,plain,
multiply(inverse(X1),multiply(X2,X1)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_10]) ).
cnf(c_0_12,plain,
multiply(X1,multiply(inverse(X2),X2)) = X1,
inference(spm,[status(thm)],[c_0_7,c_0_11]) ).
cnf(c_0_13,negated_conjecture,
multiply(a,b) != multiply(b,a),
prove_these_axioms_4 ).
cnf(c_0_14,plain,
multiply(X1,X2) = multiply(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_12]),c_0_12]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : GRP520-1 : TPTP v8.1.2. Bugfixed v2.7.0.
% 0.09/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n028.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Oct 3 03:19:07 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.41 Running first-order model finding
% 0.15/0.41 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/tmp/tmp.pmQ6Lkskt3/E---3.1_21993.p
% 0.15/0.43 # Version: 3.1pre001
% 0.15/0.43 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 # Starting sh5l with 300s (1) cores
% 0.15/0.43 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 22070 completed with status 0
% 0.15/0.43 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.15/0.43 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.43 # No SInE strategy applied
% 0.15/0.43 # Search class: FUUPF-FFSF21-MFFFFFNN
% 0.15/0.43 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.43 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.15/0.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.15/0.43 # Starting new_bool_3 with 136s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 136s (1) cores
% 0.15/0.43 # Starting sh5l with 136s (1) cores
% 0.15/0.43 # SAT001_MinMin_p005000_rr_RG with pid 22074 completed with status 0
% 0.15/0.43 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.15/0.43 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.43 # No SInE strategy applied
% 0.15/0.43 # Search class: FUUPF-FFSF21-MFFFFFNN
% 0.15/0.43 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.43 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.15/0.43 # Preprocessing time : 0.001 s
% 0.15/0.43 # Presaturation interreduction done
% 0.15/0.43
% 0.15/0.43 # Proof found!
% 0.15/0.43 # SZS status Unsatisfiable
% 0.15/0.43 # SZS output start CNFRefutation
% See solution above
% 0.15/0.43 # Parsed axioms : 2
% 0.15/0.43 # Removed by relevancy pruning/SinE : 0
% 0.15/0.43 # Initial clauses : 2
% 0.15/0.43 # Removed in clause preprocessing : 0
% 0.15/0.43 # Initial clauses in saturation : 2
% 0.15/0.43 # Processed clauses : 22
% 0.15/0.43 # ...of these trivial : 3
% 0.15/0.43 # ...subsumed : 1
% 0.15/0.43 # ...remaining for further processing : 18
% 0.15/0.43 # Other redundant clauses eliminated : 0
% 0.15/0.43 # Clauses deleted for lack of memory : 0
% 0.15/0.43 # Backward-subsumed : 0
% 0.15/0.43 # Backward-rewritten : 8
% 0.15/0.43 # Generated clauses : 452
% 0.15/0.43 # ...of the previous two non-redundant : 358
% 0.15/0.43 # ...aggressively subsumed : 0
% 0.15/0.43 # Contextual simplify-reflections : 0
% 0.15/0.43 # Paramodulations : 452
% 0.15/0.43 # Factorizations : 0
% 0.15/0.43 # NegExts : 0
% 0.15/0.43 # Equation resolutions : 0
% 0.15/0.43 # Total rewrite steps : 133
% 0.15/0.43 # Propositional unsat checks : 0
% 0.15/0.43 # Propositional check models : 0
% 0.15/0.43 # Propositional check unsatisfiable : 0
% 0.15/0.43 # Propositional clauses : 0
% 0.15/0.43 # Propositional clauses after purity: 0
% 0.15/0.43 # Propositional unsat core size : 0
% 0.15/0.43 # Propositional preprocessing time : 0.000
% 0.15/0.43 # Propositional encoding time : 0.000
% 0.15/0.43 # Propositional solver time : 0.000
% 0.15/0.43 # Success case prop preproc time : 0.000
% 0.15/0.43 # Success case prop encoding time : 0.000
% 0.15/0.43 # Success case prop solver time : 0.000
% 0.15/0.43 # Current number of processed clauses : 8
% 0.15/0.43 # Positive orientable unit clauses : 6
% 0.15/0.43 # Positive unorientable unit clauses: 2
% 0.15/0.43 # Negative unit clauses : 0
% 0.15/0.43 # Non-unit-clauses : 0
% 0.15/0.43 # Current number of unprocessed clauses: 334
% 0.15/0.43 # ...number of literals in the above : 334
% 0.15/0.43 # Current number of archived formulas : 0
% 0.15/0.43 # Current number of archived clauses : 10
% 0.15/0.43 # Clause-clause subsumption calls (NU) : 0
% 0.15/0.43 # Rec. Clause-clause subsumption calls : 0
% 0.15/0.43 # Non-unit clause-clause subsumptions : 0
% 0.15/0.43 # Unit Clause-clause subsumption calls : 10
% 0.15/0.43 # Rewrite failures with RHS unbound : 0
% 0.15/0.43 # BW rewrite match attempts : 98
% 0.15/0.43 # BW rewrite match successes : 78
% 0.15/0.43 # Condensation attempts : 0
% 0.15/0.43 # Condensation successes : 0
% 0.15/0.43 # Termbank termtop insertions : 4373
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.005 s
% 0.15/0.43 # System time : 0.002 s
% 0.15/0.43 # Total time : 0.007 s
% 0.15/0.43 # Maximum resident set size: 1508 pages
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.027 s
% 0.15/0.43 # System time : 0.006 s
% 0.15/0.43 # Total time : 0.033 s
% 0.15/0.43 # Maximum resident set size: 1668 pages
% 0.15/0.43 % E---3.1 exiting
%------------------------------------------------------------------------------