TSTP Solution File: GRP020-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP020-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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:43:29 EDT 2023
% Result : Unsatisfiable 0.21s 0.47s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 11 ( 8 unt; 0 nHn; 6 RR)
% Number of literals : 16 ( 6 equ; 7 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 17 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(total_function2,axiom,
( X3 = X4
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.WLSHTvfmR6/E---3.1_12374.p',total_function2) ).
cnf(left_inverse,axiom,
product(inverse(X1),X1,identity),
file('/export/starexec/sandbox2/tmp/tmp.WLSHTvfmR6/E---3.1_12374.p',left_inverse) ).
cnf(total_function1,axiom,
product(X1,X2,multiply(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.WLSHTvfmR6/E---3.1_12374.p',total_function1) ).
cnf(prove_inverse_X_times_X_is_id,negated_conjecture,
multiply(inverse(a),a) != identity,
file('/export/starexec/sandbox2/tmp/tmp.WLSHTvfmR6/E---3.1_12374.p',prove_inverse_X_times_X_is_id) ).
cnf(c_0_4,axiom,
( X3 = X4
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
total_function2 ).
cnf(c_0_5,axiom,
product(inverse(X1),X1,identity),
left_inverse ).
cnf(c_0_6,plain,
( identity = X1
| ~ product(inverse(X2),X2,X1) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,axiom,
product(X1,X2,multiply(X1,X2)),
total_function1 ).
cnf(c_0_8,negated_conjecture,
multiply(inverse(a),a) != identity,
prove_inverse_X_times_X_is_id ).
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)],[c_0_8,c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP020-1 : TPTP v8.1.2. Released v1.0.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n024.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Oct 3 02:37:42 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.21/0.46 Running first-order model finding
% 0.21/0.46 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.WLSHTvfmR6/E---3.1_12374.p
% 0.21/0.47 # Version: 3.1pre001
% 0.21/0.47 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.47 # Starting sh5l with 300s (1) cores
% 0.21/0.47 # new_bool_3 with pid 12456 completed with status 0
% 0.21/0.47 # Result found by new_bool_3
% 0.21/0.47 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.47 # Search class: FHUSM-FFSF21-SFFFFFNN
% 0.21/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.47 # Starting G-E--_208_C18_F1_AE_CS_SP_PI_S0a with 181s (1) cores
% 0.21/0.47 # G-E--_208_C18_F1_AE_CS_SP_PI_S0a with pid 12460 completed with status 0
% 0.21/0.47 # Result found by G-E--_208_C18_F1_AE_CS_SP_PI_S0a
% 0.21/0.47 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.47 # Search class: FHUSM-FFSF21-SFFFFFNN
% 0.21/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.47 # Starting G-E--_208_C18_F1_AE_CS_SP_PI_S0a with 181s (1) cores
% 0.21/0.47 # Preprocessing time : 0.001 s
% 0.21/0.47
% 0.21/0.47 # Proof found!
% 0.21/0.47 # SZS status Unsatisfiable
% 0.21/0.47 # SZS output start CNFRefutation
% See solution above
% 0.21/0.47 # Parsed axioms : 9
% 0.21/0.47 # Removed by relevancy pruning/SinE : 0
% 0.21/0.47 # Initial clauses : 9
% 0.21/0.47 # Removed in clause preprocessing : 0
% 0.21/0.47 # Initial clauses in saturation : 9
% 0.21/0.47 # Processed clauses : 18
% 0.21/0.47 # ...of these trivial : 1
% 0.21/0.47 # ...subsumed : 1
% 0.21/0.47 # ...remaining for further processing : 16
% 0.21/0.47 # Other redundant clauses eliminated : 0
% 0.21/0.47 # Clauses deleted for lack of memory : 0
% 0.21/0.47 # Backward-subsumed : 0
% 0.21/0.47 # Backward-rewritten : 1
% 0.21/0.47 # Generated clauses : 54
% 0.21/0.47 # ...of the previous two non-redundant : 46
% 0.21/0.47 # ...aggressively subsumed : 0
% 0.21/0.47 # Contextual simplify-reflections : 0
% 0.21/0.47 # Paramodulations : 54
% 0.21/0.47 # Factorizations : 0
% 0.21/0.47 # NegExts : 0
% 0.21/0.47 # Equation resolutions : 0
% 0.21/0.47 # Total rewrite steps : 7
% 0.21/0.47 # Propositional unsat checks : 0
% 0.21/0.47 # Propositional check models : 0
% 0.21/0.47 # Propositional check unsatisfiable : 0
% 0.21/0.47 # Propositional clauses : 0
% 0.21/0.47 # Propositional clauses after purity: 0
% 0.21/0.47 # Propositional unsat core size : 0
% 0.21/0.47 # Propositional preprocessing time : 0.000
% 0.21/0.47 # Propositional encoding time : 0.000
% 0.21/0.47 # Propositional solver time : 0.000
% 0.21/0.47 # Success case prop preproc time : 0.000
% 0.21/0.47 # Success case prop encoding time : 0.000
% 0.21/0.47 # Success case prop solver time : 0.000
% 0.21/0.47 # Current number of processed clauses : 15
% 0.21/0.47 # Positive orientable unit clauses : 9
% 0.21/0.47 # Positive unorientable unit clauses: 0
% 0.21/0.47 # Negative unit clauses : 0
% 0.21/0.47 # Non-unit-clauses : 6
% 0.21/0.47 # Current number of unprocessed clauses: 37
% 0.21/0.47 # ...number of literals in the above : 104
% 0.21/0.47 # Current number of archived formulas : 0
% 0.21/0.47 # Current number of archived clauses : 1
% 0.21/0.47 # Clause-clause subsumption calls (NU) : 14
% 0.21/0.47 # Rec. Clause-clause subsumption calls : 12
% 0.21/0.47 # Non-unit clause-clause subsumptions : 1
% 0.21/0.47 # Unit Clause-clause subsumption calls : 0
% 0.21/0.47 # Rewrite failures with RHS unbound : 0
% 0.21/0.47 # BW rewrite match attempts : 5
% 0.21/0.47 # BW rewrite match successes : 1
% 0.21/0.47 # Condensation attempts : 0
% 0.21/0.47 # Condensation successes : 0
% 0.21/0.47 # Termbank termtop insertions : 602
% 0.21/0.47
% 0.21/0.47 # -------------------------------------------------
% 0.21/0.47 # User time : 0.003 s
% 0.21/0.47 # System time : 0.001 s
% 0.21/0.47 # Total time : 0.004 s
% 0.21/0.47 # Maximum resident set size: 1648 pages
% 0.21/0.47
% 0.21/0.47 # -------------------------------------------------
% 0.21/0.47 # User time : 0.003 s
% 0.21/0.47 # System time : 0.004 s
% 0.21/0.47 # Total time : 0.007 s
% 0.21/0.47 # Maximum resident set size: 1672 pages
% 0.21/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------