TSTP Solution File: GRP549-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP549-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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:26 EDT 2023
% Result : Unsatisfiable 408.02s 136.61s
% Output : CNFRefutation 408.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 11 ( 11 unt; 0 nHn; 3 RR)
% Number of literals : 11 ( 10 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 11 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(multiply,axiom,
multiply(X1,X2) = divide(X1,divide(identity,X2)),
file('/export/starexec/sandbox/tmp/tmp.QgZKzUFl27/E---3.1_20314.p',multiply) ).
cnf(inverse,axiom,
inverse(X1) = divide(identity,X1),
file('/export/starexec/sandbox/tmp/tmp.QgZKzUFl27/E---3.1_20314.p',inverse) ).
cnf(identity,axiom,
identity = divide(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.QgZKzUFl27/E---3.1_20314.p',identity) ).
cnf(prove_these_axioms_1,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox/tmp/tmp.QgZKzUFl27/E---3.1_20314.p',prove_these_axioms_1) ).
cnf(c_0_4,axiom,
multiply(X1,X2) = divide(X1,divide(identity,X2)),
multiply ).
cnf(c_0_5,axiom,
inverse(X1) = divide(identity,X1),
inverse ).
cnf(c_0_6,axiom,
identity = divide(X1,X1),
identity ).
cnf(c_0_7,plain,
divide(X1,inverse(X2)) = multiply(X1,X2),
inference(rw,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_8,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
prove_these_axioms_1 ).
cnf(c_0_9,plain,
multiply(inverse(X1),X1) = identity,
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9]),c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : GRP549-1 : TPTP v8.1.2. Released v2.6.0.
% 0.08/0.09 % Command : run_E %s %d THM
% 0.08/0.28 % Computer : n026.cluster.edu
% 0.08/0.28 % Model : x86_64 x86_64
% 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28 % Memory : 8042.1875MB
% 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28 % CPULimit : 2400
% 0.08/0.28 % WCLimit : 300
% 0.08/0.28 % DateTime : Tue Oct 3 03:15:14 EDT 2023
% 0.08/0.28 % CPUTime :
% 0.14/0.38 Running first-order model finding
% 0.14/0.38 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.QgZKzUFl27/E---3.1_20314.p
% 408.02/136.61 # Version: 3.1pre001
% 408.02/136.61 # Preprocessing class: FSSSSMSSSSSNFFN.
% 408.02/136.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.02/136.61 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 408.02/136.61 # Starting new_bool_3 with 300s (1) cores
% 408.02/136.61 # Starting new_bool_1 with 300s (1) cores
% 408.02/136.61 # Starting sh5l with 300s (1) cores
% 408.02/136.61 # new_bool_3 with pid 20392 completed with status 0
% 408.02/136.61 # Result found by new_bool_3
% 408.02/136.61 # Preprocessing class: FSSSSMSSSSSNFFN.
% 408.02/136.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.02/136.61 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 408.02/136.61 # Starting new_bool_3 with 300s (1) cores
% 408.02/136.61 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 408.02/136.61 # Search class: FUUPM-FFSF21-MFFFFFNN
% 408.02/136.61 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 408.02/136.61 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 408.02/136.61 # H----_047_C09_12_F1_AE_ND_CS_SP_S2S with pid 20395 completed with status 0
% 408.02/136.61 # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S2S
% 408.02/136.61 # Preprocessing class: FSSSSMSSSSSNFFN.
% 408.02/136.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.02/136.61 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 408.02/136.61 # Starting new_bool_3 with 300s (1) cores
% 408.02/136.61 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 408.02/136.61 # Search class: FUUPM-FFSF21-MFFFFFNN
% 408.02/136.61 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 408.02/136.61 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 408.02/136.61 # Preprocessing time : 0.001 s
% 408.02/136.61 # Presaturation interreduction done
% 408.02/136.61
% 408.02/136.61 # Proof found!
% 408.02/136.61 # SZS status Unsatisfiable
% 408.02/136.61 # SZS output start CNFRefutation
% See solution above
% 408.02/136.61 # Parsed axioms : 5
% 408.02/136.61 # Removed by relevancy pruning/SinE : 0
% 408.02/136.61 # Initial clauses : 5
% 408.02/136.61 # Removed in clause preprocessing : 0
% 408.02/136.61 # Initial clauses in saturation : 5
% 408.02/136.61 # Processed clauses : 11
% 408.02/136.61 # ...of these trivial : 0
% 408.02/136.61 # ...subsumed : 0
% 408.02/136.61 # ...remaining for further processing : 11
% 408.02/136.61 # Other redundant clauses eliminated : 0
% 408.02/136.61 # Clauses deleted for lack of memory : 0
% 408.02/136.61 # Backward-subsumed : 0
% 408.02/136.61 # Backward-rewritten : 1
% 408.02/136.61 # Generated clauses : 5
% 408.02/136.61 # ...of the previous two non-redundant : 4
% 408.02/136.61 # ...aggressively subsumed : 0
% 408.02/136.61 # Contextual simplify-reflections : 0
% 408.02/136.61 # Paramodulations : 5
% 408.02/136.61 # Factorizations : 0
% 408.02/136.61 # NegExts : 0
% 408.02/136.61 # Equation resolutions : 0
% 408.02/136.61 # Total rewrite steps : 4
% 408.02/136.61 # Propositional unsat checks : 0
% 408.02/136.61 # Propositional check models : 0
% 408.02/136.61 # Propositional check unsatisfiable : 0
% 408.02/136.61 # Propositional clauses : 0
% 408.02/136.61 # Propositional clauses after purity: 0
% 408.02/136.61 # Propositional unsat core size : 0
% 408.02/136.61 # Propositional preprocessing time : 0.000
% 408.02/136.61 # Propositional encoding time : 0.000
% 408.02/136.61 # Propositional solver time : 0.000
% 408.02/136.61 # Success case prop preproc time : 0.000
% 408.02/136.61 # Success case prop encoding time : 0.000
% 408.02/136.61 # Success case prop solver time : 0.000
% 408.02/136.61 # Current number of processed clauses : 5
% 408.02/136.61 # Positive orientable unit clauses : 5
% 408.02/136.61 # Positive unorientable unit clauses: 0
% 408.02/136.61 # Negative unit clauses : 0
% 408.02/136.61 # Non-unit-clauses : 0
% 408.02/136.61 # Current number of unprocessed clauses: 3
% 408.02/136.61 # ...number of literals in the above : 3
% 408.02/136.61 # Current number of archived formulas : 0
% 408.02/136.61 # Current number of archived clauses : 6
% 408.02/136.61 # Clause-clause subsumption calls (NU) : 0
% 408.02/136.61 # Rec. Clause-clause subsumption calls : 0
% 408.02/136.61 # Non-unit clause-clause subsumptions : 0
% 408.02/136.61 # Unit Clause-clause subsumption calls : 0
% 408.02/136.61 # Rewrite failures with RHS unbound : 0
% 408.02/136.61 # BW rewrite match attempts : 2
% 408.02/136.61 # BW rewrite match successes : 2
% 408.02/136.61 # Condensation attempts : 0
% 408.02/136.61 # Condensation successes : 0
% 408.02/136.61 # Termbank termtop insertions : 128
% 408.02/136.61
% 408.02/136.61 # -------------------------------------------------
% 408.02/136.61 # User time : 0.001 s
% 408.02/136.61 # System time : 0.001 s
% 408.02/136.61 # Total time : 0.002 s
% 408.02/136.61 # Maximum resident set size: 1424 pages
% 408.02/136.61
% 408.02/136.61 # -------------------------------------------------
% 408.02/136.61 # User time : 0.001 s
% 408.02/136.61 # System time : 0.004 s
% 408.02/136.61 # Total time : 0.005 s
% 408.02/136.61 # Maximum resident set size: 1668 pages
% 408.02/136.61 % E---3.1 exiting
%------------------------------------------------------------------------------