TSTP Solution File: GRP608-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP608-1 : TPTP v8.1.2. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% 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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:42:15 EDT 2023
% Result : Unsatisfiable 0.24s 0.55s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 3
% Syntax : Number of clauses : 30 ( 30 unt; 0 nHn; 4 RR)
% Number of literals : 30 ( 29 equ; 3 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; 2 con; 0-2 aty)
% Number of variables : 61 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
double_divide(inverse(double_divide(X1,inverse(double_divide(inverse(X2),double_divide(X1,X3))))),X3) = X2,
file('/export/starexec/sandbox2/tmp/tmp.6l6gbG37IX/E---3.1_27130.p',single_axiom) ).
cnf(prove_these_axioms_4,negated_conjecture,
multiply(a,b) != multiply(b,a),
file('/export/starexec/sandbox2/tmp/tmp.6l6gbG37IX/E---3.1_27130.p',prove_these_axioms_4) ).
cnf(multiply,axiom,
multiply(X1,X2) = inverse(double_divide(X2,X1)),
file('/export/starexec/sandbox2/tmp/tmp.6l6gbG37IX/E---3.1_27130.p',multiply) ).
cnf(c_0_3,axiom,
double_divide(inverse(double_divide(X1,inverse(double_divide(inverse(X2),double_divide(X1,X3))))),X3) = X2,
single_axiom ).
cnf(c_0_4,plain,
double_divide(X1,inverse(double_divide(inverse(X2),double_divide(X1,double_divide(X3,X4))))) = double_divide(inverse(double_divide(X3,inverse(X2))),X4),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_5,plain,
double_divide(inverse(double_divide(inverse(double_divide(X1,inverse(X2))),X3)),double_divide(X1,X3)) = X2,
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,plain,
double_divide(inverse(X1),double_divide(inverse(double_divide(X2,inverse(X1))),double_divide(X2,inverse(X3)))) = X3,
inference(spm,[status(thm)],[c_0_5,c_0_5]) ).
cnf(c_0_7,plain,
double_divide(inverse(double_divide(inverse(X1),double_divide(X2,double_divide(X2,inverse(X3))))),X1) = X3,
inference(spm,[status(thm)],[c_0_6,c_0_3]) ).
cnf(c_0_8,plain,
double_divide(inverse(double_divide(X1,X2)),double_divide(X3,double_divide(X3,inverse(X4)))) = double_divide(inverse(double_divide(X1,inverse(X4))),X2),
inference(spm,[status(thm)],[c_0_3,c_0_7]) ).
cnf(c_0_9,plain,
double_divide(inverse(double_divide(inverse(double_divide(X1,double_divide(X1,inverse(X2)))),inverse(X3))),inverse(X2)) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_8]) ).
cnf(c_0_10,plain,
double_divide(inverse(X1),double_divide(inverse(double_divide(X2,double_divide(X2,inverse(X3)))),inverse(X3))) = X1,
inference(spm,[status(thm)],[c_0_3,c_0_9]) ).
cnf(c_0_11,plain,
double_divide(inverse(double_divide(inverse(X1),inverse(X2))),X1) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_10]),c_0_10]) ).
cnf(c_0_12,plain,
double_divide(inverse(X1),double_divide(inverse(X2),X2)) = X1,
inference(spm,[status(thm)],[c_0_3,c_0_11]) ).
cnf(c_0_13,plain,
double_divide(inverse(double_divide(inverse(X1),X1)),inverse(X2)) = X2,
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,plain,
double_divide(inverse(X1),double_divide(inverse(X1),X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_13]),c_0_13]) ).
cnf(c_0_15,plain,
double_divide(inverse(X1),inverse(double_divide(inverse(X2),X1))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_10]),c_0_10]) ).
cnf(c_0_16,plain,
inverse(double_divide(inverse(X1),X2)) = double_divide(inverse(X2),X1),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,plain,
double_divide(X1,double_divide(X1,inverse(X2))) = inverse(X2),
inference(spm,[status(thm)],[c_0_10,c_0_14]) ).
cnf(c_0_18,plain,
double_divide(double_divide(inverse(X1),X1),X2) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_12]),c_0_16]) ).
cnf(c_0_19,plain,
inverse(inverse(inverse(X1))) = inverse(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_18]) ).
cnf(c_0_20,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_19]),c_0_6]) ).
cnf(c_0_21,plain,
double_divide(X1,double_divide(X1,X2)) = X2,
inference(spm,[status(thm)],[c_0_17,c_0_20]) ).
cnf(c_0_22,plain,
double_divide(double_divide(inverse(X1),X2),X2) = inverse(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_21]),c_0_16]) ).
cnf(c_0_23,plain,
double_divide(double_divide(X1,X2),X2) = X1,
inference(spm,[status(thm)],[c_0_22,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
multiply(a,b) != multiply(b,a),
prove_these_axioms_4 ).
cnf(c_0_25,axiom,
multiply(X1,X2) = inverse(double_divide(X2,X1)),
multiply ).
cnf(c_0_26,plain,
double_divide(double_divide(X1,X2),X1) = X2,
inference(spm,[status(thm)],[c_0_21,c_0_23]) ).
cnf(c_0_27,negated_conjecture,
inverse(double_divide(a,b)) != inverse(double_divide(b,a)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25]),c_0_25]) ).
cnf(c_0_28,plain,
double_divide(X1,X2) = double_divide(X2,X1),
inference(spm,[status(thm)],[c_0_23,c_0_26]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : GRP608-1 : TPTP v8.1.2. Bugfixed v2.7.0.
% 0.13/0.16 % Command : run_E %s %d THM
% 0.17/0.38 % Computer : n020.cluster.edu
% 0.17/0.38 % Model : x86_64 x86_64
% 0.17/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.38 % Memory : 8042.1875MB
% 0.17/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.38 % CPULimit : 2400
% 0.17/0.38 % WCLimit : 300
% 0.17/0.38 % DateTime : Tue Oct 3 02:19:31 EDT 2023
% 0.17/0.38 % CPUTime :
% 0.24/0.53 Running first-order theorem proving
% 0.24/0.53 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.6l6gbG37IX/E---3.1_27130.p
% 0.24/0.55 # Version: 3.1pre001
% 0.24/0.55 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.24/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.24/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.24/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.24/0.55 # Starting sh5l with 300s (1) cores
% 0.24/0.55 # new_bool_1 with pid 27210 completed with status 0
% 0.24/0.55 # Result found by new_bool_1
% 0.24/0.55 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.24/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.24/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.24/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.24/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.55 # Search class: FUUPS-FFSF21-DFFFFFNN
% 0.24/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.24/0.55 # SAT001_MinMin_p005000_rr_RG with pid 27215 completed with status 0
% 0.24/0.55 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.24/0.55 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.24/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.24/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.24/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.24/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.55 # Search class: FUUPS-FFSF21-DFFFFFNN
% 0.24/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.24/0.55 # Preprocessing time : 0.001 s
% 0.24/0.55 # Presaturation interreduction done
% 0.24/0.55
% 0.24/0.55 # Proof found!
% 0.24/0.55 # SZS status Unsatisfiable
% 0.24/0.55 # SZS output start CNFRefutation
% See solution above
% 0.24/0.55 # Parsed axioms : 3
% 0.24/0.55 # Removed by relevancy pruning/SinE : 0
% 0.24/0.55 # Initial clauses : 3
% 0.24/0.55 # Removed in clause preprocessing : 0
% 0.24/0.55 # Initial clauses in saturation : 3
% 0.24/0.55 # Processed clauses : 38
% 0.24/0.55 # ...of these trivial : 4
% 0.24/0.55 # ...subsumed : 0
% 0.24/0.55 # ...remaining for further processing : 34
% 0.24/0.55 # Other redundant clauses eliminated : 0
% 0.24/0.55 # Clauses deleted for lack of memory : 0
% 0.24/0.55 # Backward-subsumed : 0
% 0.24/0.55 # Backward-rewritten : 22
% 0.24/0.55 # Generated clauses : 499
% 0.24/0.55 # ...of the previous two non-redundant : 397
% 0.24/0.55 # ...aggressively subsumed : 0
% 0.24/0.55 # Contextual simplify-reflections : 0
% 0.24/0.55 # Paramodulations : 499
% 0.24/0.55 # Factorizations : 0
% 0.24/0.55 # NegExts : 0
% 0.24/0.55 # Equation resolutions : 0
% 0.24/0.55 # Total rewrite steps : 283
% 0.24/0.55 # Propositional unsat checks : 0
% 0.24/0.55 # Propositional check models : 0
% 0.24/0.55 # Propositional check unsatisfiable : 0
% 0.24/0.55 # Propositional clauses : 0
% 0.24/0.55 # Propositional clauses after purity: 0
% 0.24/0.55 # Propositional unsat core size : 0
% 0.24/0.55 # Propositional preprocessing time : 0.000
% 0.24/0.55 # Propositional encoding time : 0.000
% 0.24/0.55 # Propositional solver time : 0.000
% 0.24/0.55 # Success case prop preproc time : 0.000
% 0.24/0.55 # Success case prop encoding time : 0.000
% 0.24/0.55 # Success case prop solver time : 0.000
% 0.24/0.55 # Current number of processed clauses : 9
% 0.24/0.55 # Positive orientable unit clauses : 7
% 0.24/0.55 # Positive unorientable unit clauses: 2
% 0.24/0.55 # Negative unit clauses : 0
% 0.24/0.55 # Non-unit-clauses : 0
% 0.24/0.55 # Current number of unprocessed clauses: 358
% 0.24/0.55 # ...number of literals in the above : 358
% 0.24/0.55 # Current number of archived formulas : 0
% 0.24/0.55 # Current number of archived clauses : 25
% 0.24/0.55 # Clause-clause subsumption calls (NU) : 0
% 0.24/0.55 # Rec. Clause-clause subsumption calls : 0
% 0.24/0.55 # Non-unit clause-clause subsumptions : 0
% 0.24/0.55 # Unit Clause-clause subsumption calls : 7
% 0.24/0.55 # Rewrite failures with RHS unbound : 0
% 0.24/0.55 # BW rewrite match attempts : 107
% 0.24/0.55 # BW rewrite match successes : 60
% 0.24/0.55 # Condensation attempts : 0
% 0.24/0.55 # Condensation successes : 0
% 0.24/0.55 # Termbank termtop insertions : 5687
% 0.24/0.55
% 0.24/0.55 # -------------------------------------------------
% 0.24/0.55 # User time : 0.008 s
% 0.24/0.55 # System time : 0.001 s
% 0.24/0.55 # Total time : 0.009 s
% 0.24/0.55 # Maximum resident set size: 1420 pages
% 0.24/0.55
% 0.24/0.55 # -------------------------------------------------
% 0.24/0.55 # User time : 0.008 s
% 0.24/0.55 # System time : 0.004 s
% 0.24/0.55 # Total time : 0.012 s
% 0.24/0.55 # Maximum resident set size: 1668 pages
% 0.24/0.55 % E---3.1 exiting
% 0.24/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------