TSTP Solution File: GRP515-1 by E-SAT---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.2.0
% Problem : GRP515-1 : TPTP v8.2.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d SAT
% Computer : n020.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 Jun 24 06:55:44 EDT 2024
% Result : Unsatisfiable 0.12s 0.38s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 2
% Syntax : Number of clauses : 22 ( 22 unt; 0 nHn; 6 RR)
% Number of literals : 22 ( 21 equ; 5 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.4RXYTldJ4R/E---3.1_27074.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.4RXYTldJ4R/E---3.1_27074.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,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
inference(fof_simplification,[status(thm)],[prove_these_axioms_3]) ).
cnf(c_0_14,plain,
multiply(X1,X2) = multiply(X2,X1),
inference(spm,[status(thm)],[c_0_5,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
c_0_13 ).
cnf(c_0_16,plain,
multiply(multiply(X1,X2),X3) = multiply(X2,multiply(X1,X3)),
inference(spm,[status(thm)],[c_0_10,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
multiply(c3,multiply(a3,b3)) != multiply(a3,multiply(b3,c3)),
inference(rw,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_18,plain,
multiply(X1,multiply(X2,X3)) = multiply(X3,multiply(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_16]),c_0_16]) ).
cnf(c_0_19,negated_conjecture,
multiply(b3,multiply(a3,c3)) != multiply(a3,multiply(b3,c3)),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,plain,
multiply(X1,multiply(X2,X3)) = multiply(X2,multiply(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_14]),c_0_16]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.08 % Problem : GRP515-1 : TPTP v8.2.0. Released v2.6.0.
% 0.07/0.08 % Command : run_E %s %d SAT
% 0.07/0.26 % Computer : n020.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.27 % CPULimit : 300
% 0.07/0.27 % WCLimit : 300
% 0.07/0.27 % DateTime : Thu Jun 20 10:16:53 EDT 2024
% 0.07/0.27 % CPUTime :
% 0.12/0.36 Running first-order model finding
% 0.12/0.36 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.4RXYTldJ4R/E---3.1_27074.p
% 0.12/0.38 # Version: 3.2.0
% 0.12/0.38 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.12/0.38 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.38 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.12/0.38 # Starting new_bool_3 with 300s (1) cores
% 0.12/0.38 # Starting new_bool_1 with 300s (1) cores
% 0.12/0.38 # Starting sh5l with 300s (1) cores
% 0.12/0.38 # sh5l with pid 27158 completed with status 0
% 0.12/0.38 # Result found by sh5l
% 0.12/0.38 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.12/0.38 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.38 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.12/0.38 # Starting new_bool_3 with 300s (1) cores
% 0.12/0.38 # Starting new_bool_1 with 300s (1) cores
% 0.12/0.38 # Starting sh5l with 300s (1) cores
% 0.12/0.38 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.12/0.38 # Search class: FUUPF-FFSF21-MFFFFFNN
% 0.12/0.38 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.38 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.12/0.38 # SAT001_MinMin_p005000_rr_RG with pid 27166 completed with status 0
% 0.12/0.38 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.12/0.38 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.12/0.38 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.38 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.12/0.38 # Starting new_bool_3 with 300s (1) cores
% 0.12/0.38 # Starting new_bool_1 with 300s (1) cores
% 0.12/0.38 # Starting sh5l with 300s (1) cores
% 0.12/0.38 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.12/0.38 # Search class: FUUPF-FFSF21-MFFFFFNN
% 0.12/0.38 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.38 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.12/0.38 # Preprocessing time : 0.001 s
% 0.12/0.38 # Presaturation interreduction done
% 0.12/0.38
% 0.12/0.38 # Proof found!
% 0.12/0.38 # SZS status Unsatisfiable
% 0.12/0.38 # SZS output start CNFRefutation
% See solution above
% 0.12/0.38 # Parsed axioms : 2
% 0.12/0.38 # Removed by relevancy pruning/SinE : 0
% 0.12/0.38 # Initial clauses : 2
% 0.12/0.38 # Removed in clause preprocessing : 0
% 0.12/0.38 # Initial clauses in saturation : 2
% 0.12/0.38 # Processed clauses : 135
% 0.12/0.38 # ...of these trivial : 40
% 0.12/0.38 # ...subsumed : 54
% 0.12/0.38 # ...remaining for further processing : 41
% 0.12/0.38 # Other redundant clauses eliminated : 0
% 0.12/0.38 # Clauses deleted for lack of memory : 0
% 0.12/0.38 # Backward-subsumed : 0
% 0.12/0.38 # Backward-rewritten : 17
% 0.12/0.38 # Generated clauses : 1631
% 0.12/0.38 # ...of the previous two non-redundant : 1258
% 0.12/0.38 # ...aggressively subsumed : 0
% 0.12/0.38 # Contextual simplify-reflections : 0
% 0.12/0.38 # Paramodulations : 1631
% 0.12/0.38 # Factorizations : 0
% 0.12/0.38 # NegExts : 0
% 0.12/0.38 # Equation resolutions : 0
% 0.12/0.38 # Disequality decompositions : 0
% 0.12/0.38 # Total rewrite steps : 1500
% 0.12/0.38 # ...of those cached : 714
% 0.12/0.38 # Propositional unsat checks : 0
% 0.12/0.38 # Propositional check models : 0
% 0.12/0.38 # Propositional check unsatisfiable : 0
% 0.12/0.38 # Propositional clauses : 0
% 0.12/0.38 # Propositional clauses after purity: 0
% 0.12/0.38 # Propositional unsat core size : 0
% 0.12/0.38 # Propositional preprocessing time : 0.000
% 0.12/0.38 # Propositional encoding time : 0.000
% 0.12/0.38 # Propositional solver time : 0.000
% 0.12/0.38 # Success case prop preproc time : 0.000
% 0.12/0.38 # Success case prop encoding time : 0.000
% 0.12/0.38 # Success case prop solver time : 0.000
% 0.12/0.38 # Current number of processed clauses : 22
% 0.12/0.38 # Positive orientable unit clauses : 18
% 0.12/0.38 # Positive unorientable unit clauses: 4
% 0.12/0.38 # Negative unit clauses : 0
% 0.12/0.38 # Non-unit-clauses : 0
% 0.12/0.38 # Current number of unprocessed clauses: 1062
% 0.12/0.38 # ...number of literals in the above : 1062
% 0.12/0.38 # Current number of archived formulas : 0
% 0.12/0.38 # Current number of archived clauses : 19
% 0.12/0.38 # Clause-clause subsumption calls (NU) : 0
% 0.12/0.38 # Rec. Clause-clause subsumption calls : 0
% 0.12/0.38 # Non-unit clause-clause subsumptions : 0
% 0.12/0.38 # Unit Clause-clause subsumption calls : 40
% 0.12/0.38 # Rewrite failures with RHS unbound : 0
% 0.12/0.38 # BW rewrite match attempts : 224
% 0.12/0.38 # BW rewrite match successes : 144
% 0.12/0.38 # Condensation attempts : 0
% 0.12/0.38 # Condensation successes : 0
% 0.12/0.38 # Termbank termtop insertions : 20202
% 0.12/0.38 # Search garbage collected termcells : 2
% 0.12/0.38
% 0.12/0.38 # -------------------------------------------------
% 0.12/0.38 # User time : 0.011 s
% 0.12/0.38 # System time : 0.004 s
% 0.12/0.38 # Total time : 0.015 s
% 0.12/0.38 # Maximum resident set size: 1612 pages
% 0.12/0.38
% 0.12/0.38 # -------------------------------------------------
% 0.12/0.38 # User time : 0.011 s
% 0.12/0.38 # System time : 0.007 s
% 0.12/0.38 # Total time : 0.018 s
% 0.12/0.38 # Maximum resident set size: 1684 pages
% 0.12/0.38 % E---3.1 exiting
% 0.12/0.39 % E exiting
%------------------------------------------------------------------------------