TSTP Solution File: GRP569-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP569-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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:49:29 EDT 2023
% Result : Timeout 408.33s 300.11s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of clauses : 21 ( 21 unt; 0 nHn; 4 RR)
% Number of literals : 21 ( 20 equ; 3 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 28 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(multiply,axiom,
multiply(X1,X2) = double_divide(double_divide(X2,X1),identity),
file('/export/starexec/sandbox/tmp/tmp.LRID60Bw2S/E---3.1_29232.p',multiply) ).
cnf(inverse,axiom,
inverse(X1) = double_divide(X1,identity),
file('/export/starexec/sandbox/tmp/tmp.LRID60Bw2S/E---3.1_29232.p',inverse) ).
cnf(single_axiom,axiom,
double_divide(double_divide(X1,double_divide(double_divide(X2,double_divide(X1,X3)),double_divide(X3,identity))),double_divide(identity,identity)) = X2,
file('/export/starexec/sandbox/tmp/tmp.LRID60Bw2S/E---3.1_29232.p',single_axiom) ).
cnf(identity,axiom,
identity = double_divide(X1,inverse(X1)),
file('/export/starexec/sandbox/tmp/tmp.LRID60Bw2S/E---3.1_29232.p',identity) ).
cnf(prove_these_axioms_1,negated_conjecture,
multiply(inverse(a1),a1) != identity,
file('/export/starexec/sandbox/tmp/tmp.LRID60Bw2S/E---3.1_29232.p',prove_these_axioms_1) ).
cnf(c_0_5,axiom,
multiply(X1,X2) = double_divide(double_divide(X2,X1),identity),
multiply ).
cnf(c_0_6,axiom,
inverse(X1) = double_divide(X1,identity),
inverse ).
cnf(c_0_7,axiom,
double_divide(double_divide(X1,double_divide(double_divide(X2,double_divide(X1,X3)),double_divide(X3,identity))),double_divide(identity,identity)) = X2,
single_axiom ).
cnf(c_0_8,plain,
inverse(double_divide(X1,X2)) = multiply(X2,X1),
inference(rw,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,plain,
double_divide(double_divide(X1,double_divide(double_divide(X2,double_divide(X1,X3)),inverse(X3))),inverse(identity)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_6]),c_0_6]) ).
cnf(c_0_10,axiom,
identity = double_divide(X1,inverse(X1)),
identity ).
cnf(c_0_11,plain,
inverse(inverse(X1)) = multiply(identity,X1),
inference(spm,[status(thm)],[c_0_8,c_0_6]) ).
cnf(c_0_12,plain,
double_divide(double_divide(X1,double_divide(inverse(X2),multiply(identity,X1))),inverse(identity)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_6]),c_0_11]) ).
cnf(c_0_13,plain,
double_divide(inverse(X1),multiply(identity,X1)) = identity,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
double_divide(double_divide(X1,double_divide(double_divide(X2,inverse(X1)),inverse(identity))),inverse(identity)) = X2,
inference(spm,[status(thm)],[c_0_9,c_0_6]) ).
cnf(c_0_15,plain,
double_divide(inverse(X1),inverse(identity)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_6]) ).
cnf(c_0_16,negated_conjecture,
multiply(inverse(a1),a1) != identity,
prove_these_axioms_1 ).
cnf(c_0_17,plain,
multiply(inverse(X1),X1) = inverse(identity),
inference(spm,[status(thm)],[c_0_8,c_0_10]) ).
cnf(c_0_18,plain,
double_divide(double_divide(identity,double_divide(X1,inverse(identity))),inverse(identity)) = inverse(X1),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
inverse(identity) != identity,
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_10]),c_0_6]),c_0_15]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GRP569-1 : TPTP v8.1.2. Released v2.6.0.
% 0.08/0.15 % Command : run_E %s %d THM
% 0.16/0.36 % Computer : n013.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 2400
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Tue Oct 3 02:27:44 EDT 2023
% 0.16/0.36 % CPUTime :
% 0.22/0.49 Running first-order model finding
% 0.22/0.49 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.LRID60Bw2S/E---3.1_29232.p
% 408.33/300.11 # Version: 3.1pre001
% 408.33/300.11 # Preprocessing class: FSSSSMSSSSSNFFN.
% 408.33/300.11 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.33/300.11 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 408.33/300.11 # Starting new_bool_3 with 300s (1) cores
% 408.33/300.11 # Starting new_bool_1 with 300s (1) cores
% 408.33/300.11 # Starting sh5l with 300s (1) cores
% 408.33/300.11 # new_bool_1 with pid 29351 completed with status 0
% 408.33/300.11 # Result found by new_bool_1
% 408.33/300.11 # Preprocessing class: FSSSSMSSSSSNFFN.
% 408.33/300.11 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.33/300.11 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 408.33/300.11 # Starting new_bool_3 with 300s (1) cores
% 408.33/300.11 # Starting new_bool_1 with 300s (1) cores
% 408.33/300.11 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 408.33/300.11 # Search class: FUUPM-FFSF21-MFFFFFNN
% 408.33/300.11 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 408.33/300.11 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 408.33/300.11 # H----_047_C09_12_F1_AE_ND_CS_SP_S2S with pid 29353 completed with status 0
% 408.33/300.11 # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S2S
% 408.33/300.11 # Preprocessing class: FSSSSMSSSSSNFFN.
% 408.33/300.11 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.33/300.11 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 408.33/300.11 # Starting new_bool_3 with 300s (1) cores
% 408.33/300.11 # Starting new_bool_1 with 300s (1) cores
% 408.33/300.11 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 408.33/300.11 # Search class: FUUPM-FFSF21-MFFFFFNN
% 408.33/300.11 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 408.33/300.11 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 408.33/300.11 # Preprocessing time : 0.001 s
% 408.33/300.11 # Presaturation interreduction done
% 408.33/300.11
% 408.33/300.11 # Proof found!
% 408.33/300.11 # SZS status Unsatisfiable
% 408.33/300.11 # SZS output start CNFRefutation
% See solution above
% 408.33/300.11 # Parsed axioms : 5
% 408.33/300.11 # Removed by relevancy pruning/SinE : 0
% 408.33/300.11 # Initial clauses : 5
% 408.33/300.11 # Removed in clause preprocessing : 0
% 408.33/300.11 # Initial clauses in saturation : 5
% 408.33/300.11 # Processed clauses : 45
% 408.33/300.11 # ...of these trivial : 16
% 408.33/300.11 # ...subsumed : 0
% 408.33/300.11 # ...remaining for further processing : 29
% 408.33/300.11 # Other redundant clauses eliminated : 0
% 408.33/300.11 # Clauses deleted for lack of memory : 0
% 408.33/300.11 # Backward-subsumed : 0
% 408.33/300.11 # Backward-rewritten : 3
% 408.33/300.11 # Generated clauses : 141
% 408.33/300.11 # ...of the previous two non-redundant : 88
% 408.33/300.11 # ...aggressively subsumed : 0
% 408.33/300.11 # Contextual simplify-reflections : 0
% 408.33/300.11 # Paramodulations : 141
% 408.33/300.11 # Factorizations : 0
% 408.33/300.11 # NegExts : 0
% 408.33/300.11 # Equation resolutions : 0
% 408.33/300.11 # Total rewrite steps : 166
% 408.33/300.11 # Propositional unsat checks : 0
% 408.33/300.11 # Propositional check models : 0
% 408.33/300.11 # Propositional check unsatisfiable : 0
% 408.33/300.11 # Propositional clauses : 0
% 408.33/300.11 # Propositional clauses after purity: 0
% 408.33/300.11 # Propositional unsat core size : 0
% 408.33/300.11 # Propositional preprocessing time : 0.000
% 408.33/300.11 # Propositional encoding time : 0.000
% 408.33/300.11 # Propositional solver time : 0.000
% 408.33/300.11 # Success case prop preproc time : 0.000
% 408.33/300.11 # Success case prop encoding time : 0.000
% 408.33/300.11 # Success case prop solver time : 0.000
% 408.33/300.11 # Current number of processed clauses : 21
% 408.33/300.11 # Positive orientable unit clauses : 20
% 408.33/300.11 # Positive unorientable unit clauses: 0
% 408.33/300.11 # Negative unit clauses : 1
% 408.33/300.11 # Non-unit-clauses : 0
% 408.33/300.11 # Current number of unprocessed clauses: 35
% 408.33/300.11 # ...number of literals in the above : 35
% 408.33/300.11 # Current number of archived formulas : 0
% 408.33/300.11 # Current number of archived clauses : 8
% 408.33/300.11 # Clause-clause subsumption calls (NU) : 0
% 408.33/300.11 # Rec. Clause-clause subsumption calls : 0
% 408.33/300.11 # Non-unit clause-clause subsumptions : 0
% 408.33/300.11 # Unit Clause-clause subsumption calls : 0
% 408.33/300.11 # Rewrite failures with RHS unbound : 0
% 408.33/300.11 # BW rewrite match attempts : 6
% 408.33/300.11 # BW rewrite match successes : 3
% 408.33/300.11 # Condensation attempts : 0
% 408.33/300.11 # Condensation successes : 0
% 408.33/300.11 # Termbank termtop insertions : 1640
% 408.33/300.11
% 408.33/300.11 # -------------------------------------------------
% 408.33/300.11 # User time : 0.003 s
% 408.33/300.11 # System time : 0.000 s
% 408.33/300.11 # Total time : 0.003 s
% 408.33/300.11 # Maximum resident set size: 1428 pages
% 408.33/300.11
% 408.33/300.11 # -------------------------------------------------
% 408.33/300.11 # User time : 0.004 s
% 408.33/300.11 # System time : 0.001 s
% 408.33/300.11 # Total time : 0.005 s
% 408.33/300.11 # Maximum resident set size: 1676 pages
% 408.33/300.11 % E---3.1 exiting
%------------------------------------------------------------------------------