TSTP Solution File: GRP509-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRP509-1 : TPTP v8.2.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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:49:48 EDT 2024
% Result : Unsatisfiable 0.19s 0.49s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 2
% Syntax : Number of clauses : 22 ( 22 unt; 0 nHn; 5 RR)
% Number of literals : 22 ( 21 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 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(multiply(multiply(X1,X2),X3),inverse(multiply(X1,X3))) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms_1,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_1) ).
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(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_5,plain,
multiply(multiply(X1,inverse(X2)),inverse(X1)) = inverse(X2),
inference(spm,[status(thm)],[c_0_4,c_0_2]) ).
cnf(c_0_6,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_7,plain,
multiply(inverse(X1),inverse(multiply(X2,inverse(X1)))) = inverse(X2),
inference(spm,[status(thm)],[c_0_5,c_0_5]) ).
cnf(c_0_8,plain,
inverse(multiply(X1,inverse(multiply(X1,X2)))) = X2,
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,plain,
inverse(inverse(inverse(X1))) = inverse(X1),
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_10,plain,
inverse(inverse(X1)) = X1,
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_11,plain,
inverse(multiply(X1,inverse(X2))) = multiply(inverse(X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_7]),c_0_10]) ).
cnf(c_0_12,plain,
multiply(multiply(X1,X2),inverse(X1)) = X2,
inference(spm,[status(thm)],[c_0_5,c_0_10]) ).
cnf(c_0_13,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[c_0_8,c_0_11]) ).
cnf(c_0_14,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
inference(fof_simplification,[status(thm)],[prove_these_axioms_1]) ).
cnf(c_0_15,plain,
multiply(X1,X2) = multiply(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_10]) ).
cnf(c_0_16,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
c_0_14 ).
cnf(c_0_17,plain,
multiply(X1,multiply(inverse(X1),X2)) = X2,
inference(spm,[status(thm)],[c_0_13,c_0_10]) ).
cnf(c_0_18,plain,
multiply(X1,multiply(X2,inverse(X2))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_12]),c_0_11]),c_0_15]) ).
cnf(c_0_19,negated_conjecture,
multiply(a1,inverse(a1)) != multiply(b1,inverse(b1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_15]),c_0_15]) ).
cnf(c_0_20,plain,
multiply(X1,inverse(X1)) = multiply(X2,inverse(X2)),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_19,c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP509-1 : TPTP v8.2.0. Released v2.6.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n003.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 05:53:22 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 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/benchmark/theBenchmark.p
% 0.19/0.49 # Version: 3.1.0
% 0.19/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49 # Starting sh5l with 300s (1) cores
% 0.19/0.49 # new_bool_3 with pid 16363 completed with status 0
% 0.19/0.49 # Result found by new_bool_3
% 0.19/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.49 # Search class: FUUPF-FFSF21-MFFFFFNN
% 0.19/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.49 # SAT001_MinMin_p005000_rr_RG with pid 16368 completed with status 0
% 0.19/0.49 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.49 # Search class: FUUPF-FFSF21-MFFFFFNN
% 0.19/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.49 # Preprocessing time : 0.001 s
% 0.19/0.49 # Presaturation interreduction done
% 0.19/0.49
% 0.19/0.49 # Proof found!
% 0.19/0.49 # SZS status Unsatisfiable
% 0.19/0.49 # SZS output start CNFRefutation
% See solution above
% 0.19/0.49 # Parsed axioms : 2
% 0.19/0.49 # Removed by relevancy pruning/SinE : 0
% 0.19/0.49 # Initial clauses : 2
% 0.19/0.49 # Removed in clause preprocessing : 0
% 0.19/0.49 # Initial clauses in saturation : 2
% 0.19/0.49 # Processed clauses : 91
% 0.19/0.49 # ...of these trivial : 41
% 0.19/0.49 # ...subsumed : 16
% 0.19/0.49 # ...remaining for further processing : 34
% 0.19/0.49 # Other redundant clauses eliminated : 0
% 0.19/0.49 # Clauses deleted for lack of memory : 0
% 0.19/0.49 # Backward-subsumed : 0
% 0.19/0.49 # Backward-rewritten : 14
% 0.19/0.49 # Generated clauses : 993
% 0.19/0.49 # ...of the previous two non-redundant : 831
% 0.19/0.49 # ...aggressively subsumed : 0
% 0.19/0.49 # Contextual simplify-reflections : 0
% 0.19/0.49 # Paramodulations : 992
% 0.19/0.49 # Factorizations : 0
% 0.19/0.49 # NegExts : 0
% 0.19/0.49 # Equation resolutions : 0
% 0.19/0.49 # Disequality decompositions : 0
% 0.19/0.49 # Total rewrite steps : 719
% 0.19/0.49 # ...of those cached : 395
% 0.19/0.49 # Propositional unsat checks : 0
% 0.19/0.49 # Propositional check models : 0
% 0.19/0.49 # Propositional check unsatisfiable : 0
% 0.19/0.49 # Propositional clauses : 0
% 0.19/0.49 # Propositional clauses after purity: 0
% 0.19/0.49 # Propositional unsat core size : 0
% 0.19/0.49 # Propositional preprocessing time : 0.000
% 0.19/0.49 # Propositional encoding time : 0.000
% 0.19/0.49 # Propositional solver time : 0.000
% 0.19/0.49 # Success case prop preproc time : 0.000
% 0.19/0.49 # Success case prop encoding time : 0.000
% 0.19/0.49 # Success case prop solver time : 0.000
% 0.19/0.49 # Current number of processed clauses : 17
% 0.19/0.49 # Positive orientable unit clauses : 15
% 0.19/0.49 # Positive unorientable unit clauses: 2
% 0.19/0.49 # Negative unit clauses : 0
% 0.19/0.49 # Non-unit-clauses : 0
% 0.19/0.49 # Current number of unprocessed clauses: 720
% 0.19/0.49 # ...number of literals in the above : 720
% 0.19/0.49 # Current number of archived formulas : 0
% 0.19/0.49 # Current number of archived clauses : 17
% 0.19/0.49 # Clause-clause subsumption calls (NU) : 0
% 0.19/0.49 # Rec. Clause-clause subsumption calls : 0
% 0.19/0.49 # Non-unit clause-clause subsumptions : 0
% 0.19/0.49 # Unit Clause-clause subsumption calls : 14
% 0.19/0.49 # Rewrite failures with RHS unbound : 0
% 0.19/0.49 # BW rewrite match attempts : 73
% 0.19/0.49 # BW rewrite match successes : 47
% 0.19/0.49 # Condensation attempts : 0
% 0.19/0.49 # Condensation successes : 0
% 0.19/0.49 # Termbank termtop insertions : 10643
% 0.19/0.49 # Search garbage collected termcells : 2
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.014 s
% 0.19/0.49 # System time : 0.001 s
% 0.19/0.49 # Total time : 0.015 s
% 0.19/0.49 # Maximum resident set size: 1624 pages
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.016 s
% 0.19/0.49 # System time : 0.002 s
% 0.19/0.49 # Total time : 0.018 s
% 0.19/0.49 # Maximum resident set size: 1680 pages
% 0.19/0.49 % E---3.1 exiting
% 0.19/0.49 % E exiting
%------------------------------------------------------------------------------