TSTP Solution File: GRP515-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP515-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.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:42:00 EDT 2023
% Result : Unsatisfiable 0.14s 0.42s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 2
% Syntax : Number of clauses : 21 ( 21 unt; 0 nHn; 5 RR)
% Number of literals : 21 ( 20 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 47 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
multiply(X1,multiply(multiply(X2,X3),inverse(multiply(X1,X3)))) = X2,
file('/export/starexec/sandbox2/tmp/tmp.FBgkuvfwNm/E---3.1_20695.p',single_axiom) ).
cnf(prove_these_axioms_3,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox2/tmp/tmp.FBgkuvfwNm/E---3.1_20695.p',prove_these_axioms_3) ).
cnf(c_0_2,axiom,
multiply(X1,multiply(multiply(X2,X3),inverse(multiply(X1,X3)))) = X2,
single_axiom ).
cnf(c_0_3,plain,
multiply(X1,multiply(X2,inverse(multiply(X1,multiply(multiply(X2,X3),inverse(multiply(X4,X3))))))) = X4,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
multiply(X1,multiply(X2,inverse(X2))) = X1,
inference(spm,[status(thm)],[c_0_3,c_0_2]) ).
cnf(c_0_5,plain,
multiply(X1,multiply(X2,inverse(X1))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_4]),c_0_4]) ).
cnf(c_0_6,plain,
multiply(X1,multiply(multiply(X2,multiply(multiply(X3,X4),inverse(multiply(X1,X4)))),inverse(X3))) = X2,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_7,plain,
multiply(multiply(X1,X2),multiply(X3,inverse(multiply(X3,X2)))) = X1,
inference(spm,[status(thm)],[c_0_3,c_0_5]) ).
cnf(c_0_8,plain,
multiply(X1,multiply(multiply(X2,X3),inverse(X2))) = multiply(X1,X3),
inference(spm,[status(thm)],[c_0_6,c_0_5]) ).
cnf(c_0_9,plain,
multiply(multiply(X1,X2),multiply(X3,inverse(X1))) = multiply(X3,X2),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
multiply(multiply(X1,X2),X3) = multiply(multiply(X1,X3),X2),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,plain,
multiply(X1,multiply(multiply(X2,inverse(X3)),multiply(multiply(X3,X4),inverse(multiply(X1,X4))))) = X2,
inference(rw,[status(thm)],[c_0_6,c_0_10]) ).
cnf(c_0_12,plain,
multiply(multiply(X1,X2),inverse(X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_2]),c_0_10]) ).
cnf(c_0_13,plain,
multiply(X1,X2) = multiply(X2,X1),
inference(spm,[status(thm)],[c_0_5,c_0_12]) ).
cnf(c_0_14,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
prove_these_axioms_3 ).
cnf(c_0_15,plain,
multiply(multiply(X1,X2),X3) = multiply(X2,multiply(X1,X3)),
inference(spm,[status(thm)],[c_0_10,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
multiply(c3,multiply(a3,b3)) != multiply(a3,multiply(b3,c3)),
inference(rw,[status(thm)],[c_0_14,c_0_13]) ).
cnf(c_0_17,plain,
multiply(X1,multiply(X2,X3)) = multiply(X3,multiply(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_15]),c_0_15]) ).
cnf(c_0_18,negated_conjecture,
multiply(b3,multiply(a3,c3)) != multiply(a3,multiply(b3,c3)),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,plain,
multiply(X1,multiply(X2,X3)) = multiply(X2,multiply(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_13]),c_0_15]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : GRP515-1 : TPTP v8.1.2. Released v2.6.0.
% 0.02/0.10 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n031.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 2400
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Tue Oct 3 03:09:43 EDT 2023
% 0.09/0.29 % CPUTime :
% 0.14/0.39 Running first-order theorem proving
% 0.14/0.39 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.FBgkuvfwNm/E---3.1_20695.p
% 0.14/0.42 # Version: 3.1pre001
% 0.14/0.42 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.42 # Starting sh5l with 300s (1) cores
% 0.14/0.42 # new_bool_1 with pid 20775 completed with status 8
% 0.14/0.42 # new_bool_3 with pid 20774 completed with status 8
% 0.14/0.42 # sh5l with pid 20776 completed with status 0
% 0.14/0.42 # Result found by sh5l
% 0.14/0.42 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.42 # Starting sh5l with 300s (1) cores
% 0.14/0.42 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.42 # Search class: FUUPF-FFSF21-MFFFFFNN
% 0.14/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.42 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.14/0.42 # SAT001_MinMin_p005000_rr_RG with pid 20782 completed with status 0
% 0.14/0.42 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.14/0.42 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.42 # Starting sh5l with 300s (1) cores
% 0.14/0.42 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.42 # Search class: FUUPF-FFSF21-MFFFFFNN
% 0.14/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.42 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.14/0.42 # Preprocessing time : 0.001 s
% 0.14/0.42 # Presaturation interreduction done
% 0.14/0.42
% 0.14/0.42 # Proof found!
% 0.14/0.42 # SZS status Unsatisfiable
% 0.14/0.42 # SZS output start CNFRefutation
% See solution above
% 0.14/0.42 # Parsed axioms : 2
% 0.14/0.42 # Removed by relevancy pruning/SinE : 0
% 0.14/0.42 # Initial clauses : 2
% 0.14/0.42 # Removed in clause preprocessing : 0
% 0.14/0.42 # Initial clauses in saturation : 2
% 0.14/0.42 # Processed clauses : 135
% 0.14/0.42 # ...of these trivial : 40
% 0.14/0.42 # ...subsumed : 54
% 0.14/0.42 # ...remaining for further processing : 41
% 0.14/0.42 # Other redundant clauses eliminated : 0
% 0.14/0.42 # Clauses deleted for lack of memory : 0
% 0.14/0.42 # Backward-subsumed : 0
% 0.14/0.42 # Backward-rewritten : 17
% 0.14/0.42 # Generated clauses : 1631
% 0.14/0.42 # ...of the previous two non-redundant : 1258
% 0.14/0.42 # ...aggressively subsumed : 0
% 0.14/0.42 # Contextual simplify-reflections : 0
% 0.14/0.42 # Paramodulations : 1631
% 0.14/0.42 # Factorizations : 0
% 0.14/0.42 # NegExts : 0
% 0.14/0.42 # Equation resolutions : 0
% 0.14/0.42 # Total rewrite steps : 1500
% 0.14/0.42 # Propositional unsat checks : 0
% 0.14/0.42 # Propositional check models : 0
% 0.14/0.42 # Propositional check unsatisfiable : 0
% 0.14/0.42 # Propositional clauses : 0
% 0.14/0.42 # Propositional clauses after purity: 0
% 0.14/0.42 # Propositional unsat core size : 0
% 0.14/0.42 # Propositional preprocessing time : 0.000
% 0.14/0.42 # Propositional encoding time : 0.000
% 0.14/0.42 # Propositional solver time : 0.000
% 0.14/0.42 # Success case prop preproc time : 0.000
% 0.14/0.42 # Success case prop encoding time : 0.000
% 0.14/0.42 # Success case prop solver time : 0.000
% 0.14/0.42 # Current number of processed clauses : 22
% 0.14/0.42 # Positive orientable unit clauses : 18
% 0.14/0.42 # Positive unorientable unit clauses: 4
% 0.14/0.42 # Negative unit clauses : 0
% 0.14/0.42 # Non-unit-clauses : 0
% 0.14/0.42 # Current number of unprocessed clauses: 1062
% 0.14/0.42 # ...number of literals in the above : 1062
% 0.14/0.42 # Current number of archived formulas : 0
% 0.14/0.42 # Current number of archived clauses : 19
% 0.14/0.42 # Clause-clause subsumption calls (NU) : 0
% 0.14/0.42 # Rec. Clause-clause subsumption calls : 0
% 0.14/0.42 # Non-unit clause-clause subsumptions : 0
% 0.14/0.42 # Unit Clause-clause subsumption calls : 40
% 0.14/0.42 # Rewrite failures with RHS unbound : 0
% 0.14/0.42 # BW rewrite match attempts : 224
% 0.14/0.42 # BW rewrite match successes : 144
% 0.14/0.42 # Condensation attempts : 0
% 0.14/0.42 # Condensation successes : 0
% 0.14/0.42 # Termbank termtop insertions : 20199
% 0.14/0.42
% 0.14/0.42 # -------------------------------------------------
% 0.14/0.42 # User time : 0.020 s
% 0.14/0.42 # System time : 0.003 s
% 0.14/0.42 # Total time : 0.023 s
% 0.14/0.42 # Maximum resident set size: 1420 pages
% 0.14/0.42
% 0.14/0.42 # -------------------------------------------------
% 0.14/0.42 # User time : 0.039 s
% 0.14/0.42 # System time : 0.018 s
% 0.14/0.42 # Total time : 0.057 s
% 0.14/0.42 # Maximum resident set size: 1664 pages
% 0.14/0.42 % E---3.1 exiting
% 0.14/0.42 % E---3.1 exiting
%------------------------------------------------------------------------------