TSTP Solution File: GRP512-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRP512-1 : TPTP v8.1.2. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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 : Sat May 4 07:53:04 EDT 2024
% Result : Unsatisfiable 272.14s 136.66s
% Output : CNFRefutation 272.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 2
% Syntax : Number of clauses : 16 ( 16 unt; 0 nHn; 4 RR)
% Number of literals : 16 ( 15 equ; 3 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 : 31 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
multiply(multiply(multiply(X1,X2),X3),inverse(multiply(X1,X3))) = X2,
file('/export/starexec/sandbox/tmp/tmp.ujlPQr8YgQ/E---3.1_21672.p',single_axiom) ).
cnf(prove_these_axioms_4,negated_conjecture,
multiply(a,b) != multiply(b,a),
file('/export/starexec/sandbox/tmp/tmp.ujlPQr8YgQ/E---3.1_21672.p',prove_these_axioms_4) ).
cnf(c_0_2,axiom,
multiply(multiply(multiply(X1,X2),X3),inverse(multiply(X1,X3))) = X2,
single_axiom ).
cnf(c_0_3,plain,
multiply(multiply(X1,X2),inverse(multiply(multiply(multiply(X3,X1),X4),X2))) = inverse(multiply(X3,X4)),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
multiply(X1,inverse(multiply(multiply(X2,X1),inverse(multiply(X2,X3))))) = X3,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_5,plain,
multiply(multiply(X1,inverse(multiply(X2,X3))),inverse(X1)) = inverse(multiply(X2,X3)),
inference(spm,[status(thm)],[c_0_3,c_0_2]) ).
cnf(c_0_6,plain,
inverse(multiply(X1,multiply(X2,inverse(multiply(multiply(X1,X2),X3))))) = X3,
inference(spm,[status(thm)],[c_0_4,c_0_3]) ).
cnf(c_0_7,plain,
multiply(multiply(X1,X2),inverse(X1)) = X2,
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,plain,
multiply(X1,inverse(multiply(X2,X1))) = inverse(X2),
inference(spm,[status(thm)],[c_0_7,c_0_7]) ).
cnf(c_0_9,plain,
multiply(X1,inverse(inverse(X2))) = multiply(X2,X1),
inference(spm,[status(thm)],[c_0_4,c_0_8]) ).
cnf(c_0_10,plain,
multiply(X1,multiply(inverse(X1),X2)) = X2,
inference(spm,[status(thm)],[c_0_7,c_0_9]) ).
cnf(c_0_11,negated_conjecture,
multiply(a,b) != multiply(b,a),
inference(fof_simplification,[status(thm)],[prove_these_axioms_4]) ).
cnf(c_0_12,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_10,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
multiply(a,b) != multiply(b,a),
c_0_11 ).
cnf(c_0_14,plain,
multiply(X1,X2) = multiply(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_12]),c_0_9]),c_0_9]) ).
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.07/0.13 % Problem : GRP512-1 : TPTP v8.1.2. Bugfixed v2.7.0.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n009.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 15:52:08 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.22/0.50 Running first-order theorem proving
% 0.22/0.50 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.ujlPQr8YgQ/E---3.1_21672.p
% 272.14/136.66 # Version: 3.1.0
% 272.14/136.66 # Preprocessing class: FSSSSMSSSSSNFFN.
% 272.14/136.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 272.14/136.66 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 272.14/136.66 # Starting new_bool_3 with 300s (1) cores
% 272.14/136.66 # Starting new_bool_1 with 300s (1) cores
% 272.14/136.66 # Starting sh5l with 300s (1) cores
% 272.14/136.66 # sh5l with pid 21763 completed with status 0
% 272.14/136.66 # Result found by sh5l
% 272.14/136.66 # Preprocessing class: FSSSSMSSSSSNFFN.
% 272.14/136.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 272.14/136.66 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 272.14/136.66 # Starting new_bool_3 with 300s (1) cores
% 272.14/136.66 # Starting new_bool_1 with 300s (1) cores
% 272.14/136.66 # Starting sh5l with 300s (1) cores
% 272.14/136.66 # SinE strategy is gf500_gu_R04_F100_L20000
% 272.14/136.66 # Search class: FUUPF-FFSF21-MFFFFFNN
% 272.14/136.66 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 272.14/136.66 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 272.14/136.66 # SAT001_MinMin_p005000_rr_RG with pid 21768 completed with status 0
% 272.14/136.66 # Result found by SAT001_MinMin_p005000_rr_RG
% 272.14/136.66 # Preprocessing class: FSSSSMSSSSSNFFN.
% 272.14/136.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 272.14/136.66 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 272.14/136.66 # Starting new_bool_3 with 300s (1) cores
% 272.14/136.66 # Starting new_bool_1 with 300s (1) cores
% 272.14/136.66 # Starting sh5l with 300s (1) cores
% 272.14/136.66 # SinE strategy is gf500_gu_R04_F100_L20000
% 272.14/136.66 # Search class: FUUPF-FFSF21-MFFFFFNN
% 272.14/136.66 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 272.14/136.66 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 272.14/136.66 # Preprocessing time : 0.001 s
% 272.14/136.66 # Presaturation interreduction done
% 272.14/136.66
% 272.14/136.66 # Proof found!
% 272.14/136.66 # SZS status Unsatisfiable
% 272.14/136.66 # SZS output start CNFRefutation
% See solution above
% 272.14/136.66 # Parsed axioms : 2
% 272.14/136.66 # Removed by relevancy pruning/SinE : 0
% 272.14/136.66 # Initial clauses : 2
% 272.14/136.66 # Removed in clause preprocessing : 0
% 272.14/136.66 # Initial clauses in saturation : 2
% 272.14/136.66 # Processed clauses : 14
% 272.14/136.66 # ...of these trivial : 0
% 272.14/136.66 # ...subsumed : 0
% 272.14/136.66 # ...remaining for further processing : 14
% 272.14/136.66 # Other redundant clauses eliminated : 0
% 272.14/136.66 # Clauses deleted for lack of memory : 0
% 272.14/136.66 # Backward-subsumed : 0
% 272.14/136.66 # Backward-rewritten : 2
% 272.14/136.66 # Generated clauses : 186
% 272.14/136.66 # ...of the previous two non-redundant : 140
% 272.14/136.66 # ...aggressively subsumed : 0
% 272.14/136.66 # Contextual simplify-reflections : 0
% 272.14/136.66 # Paramodulations : 186
% 272.14/136.66 # Factorizations : 0
% 272.14/136.66 # NegExts : 0
% 272.14/136.66 # Equation resolutions : 0
% 272.14/136.66 # Disequality decompositions : 0
% 272.14/136.66 # Total rewrite steps : 31
% 272.14/136.66 # ...of those cached : 7
% 272.14/136.66 # Propositional unsat checks : 0
% 272.14/136.66 # Propositional check models : 0
% 272.14/136.66 # Propositional check unsatisfiable : 0
% 272.14/136.66 # Propositional clauses : 0
% 272.14/136.66 # Propositional clauses after purity: 0
% 272.14/136.66 # Propositional unsat core size : 0
% 272.14/136.66 # Propositional preprocessing time : 0.000
% 272.14/136.67 # Propositional encoding time : 0.000
% 272.14/136.67 # Propositional solver time : 0.000
% 272.14/136.67 # Success case prop preproc time : 0.000
% 272.14/136.67 # Success case prop encoding time : 0.000
% 272.14/136.67 # Success case prop solver time : 0.000
% 272.14/136.67 # Current number of processed clauses : 10
% 272.14/136.67 # Positive orientable unit clauses : 9
% 272.14/136.67 # Positive unorientable unit clauses: 1
% 272.14/136.67 # Negative unit clauses : 0
% 272.14/136.67 # Non-unit-clauses : 0
% 272.14/136.67 # Current number of unprocessed clauses: 130
% 272.14/136.67 # ...number of literals in the above : 130
% 272.14/136.67 # Current number of archived formulas : 0
% 272.14/136.67 # Current number of archived clauses : 4
% 272.14/136.67 # Clause-clause subsumption calls (NU) : 0
% 272.14/136.67 # Rec. Clause-clause subsumption calls : 0
% 272.14/136.67 # Non-unit clause-clause subsumptions : 0
% 272.14/136.67 # Unit Clause-clause subsumption calls : 9
% 272.14/136.67 # Rewrite failures with RHS unbound : 0
% 272.14/136.67 # BW rewrite match attempts : 40
% 272.14/136.67 # BW rewrite match successes : 33
% 272.14/136.67 # Condensation attempts : 0
% 272.14/136.67 # Condensation successes : 0
% 272.14/136.67 # Termbank termtop insertions : 1629
% 272.14/136.67 # Search garbage collected termcells : 2
% 272.14/136.67
% 272.14/136.67 # -------------------------------------------------
% 272.14/136.67 # User time : 0.005 s
% 272.14/136.67 # System time : 0.003 s
% 272.14/136.67 # Total time : 0.008 s
% 272.14/136.67 # Maximum resident set size: 1620 pages
% 272.14/136.67
% 272.14/136.67 # -------------------------------------------------
% 272.14/136.67 # User time : 0.005 s
% 272.14/136.67 # System time : 0.006 s
% 272.14/136.67 # Total time : 0.012 s
% 272.14/136.67 # Maximum resident set size: 1680 pages
% 272.14/136.67 % E---3.1 exiting
% 272.14/136.67 % E exiting
%------------------------------------------------------------------------------