TSTP Solution File: LCL161-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL161-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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 18:11:45 EDT 2023
% Result : Unsatisfiable 0.22s 0.51s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% 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 : 4 ( 1 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 : 25 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_wajsberg_axiom,negated_conjecture,
implies(truth,x) != x,
file('/export/starexec/sandbox/tmp/tmp.HzaMGqiVfr/E---3.1_4314.p',prove_wajsberg_axiom) ).
cnf(implies_definition,axiom,
implies(X1,X2) = xor(truth,and_star(X1,xor(truth,X2))),
file('/export/starexec/sandbox/tmp/tmp.HzaMGqiVfr/E---3.1_4314.p',implies_definition) ).
cnf(axiom_4,axiom,
and_star(X1,truth) = X1,
file('/export/starexec/sandbox/tmp/tmp.HzaMGqiVfr/E---3.1_4314.p',axiom_4) ).
cnf(and_star_commutativity,axiom,
and_star(X1,X2) = and_star(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.HzaMGqiVfr/E---3.1_4314.p',and_star_commutativity) ).
cnf(axiom_2,axiom,
xor(X1,falsehood) = X1,
file('/export/starexec/sandbox/tmp/tmp.HzaMGqiVfr/E---3.1_4314.p',axiom_2) ).
cnf(xor_commutativity,axiom,
xor(X1,X2) = xor(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.HzaMGqiVfr/E---3.1_4314.p',xor_commutativity) ).
cnf(axiom_7,axiom,
xor(X1,xor(truth,X2)) = xor(xor(X1,truth),X2),
file('/export/starexec/sandbox/tmp/tmp.HzaMGqiVfr/E---3.1_4314.p',axiom_7) ).
cnf(axiom_3,axiom,
xor(X1,X1) = falsehood,
file('/export/starexec/sandbox/tmp/tmp.HzaMGqiVfr/E---3.1_4314.p',axiom_3) ).
cnf(c_0_8,negated_conjecture,
implies(truth,x) != x,
prove_wajsberg_axiom ).
cnf(c_0_9,axiom,
implies(X1,X2) = xor(truth,and_star(X1,xor(truth,X2))),
implies_definition ).
cnf(c_0_10,axiom,
and_star(X1,truth) = X1,
axiom_4 ).
cnf(c_0_11,axiom,
and_star(X1,X2) = and_star(X2,X1),
and_star_commutativity ).
cnf(c_0_12,axiom,
xor(X1,falsehood) = X1,
axiom_2 ).
cnf(c_0_13,axiom,
xor(X1,X2) = xor(X2,X1),
xor_commutativity ).
cnf(c_0_14,negated_conjecture,
xor(truth,and_star(truth,xor(truth,x))) != x,
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_15,plain,
and_star(truth,X1) = X1,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,axiom,
xor(X1,xor(truth,X2)) = xor(xor(X1,truth),X2),
axiom_7 ).
cnf(c_0_17,axiom,
xor(X1,X1) = falsehood,
axiom_3 ).
cnf(c_0_18,plain,
xor(falsehood,X1) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,negated_conjecture,
xor(truth,xor(truth,x)) != x,
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
xor(truth,xor(truth,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : LCL161-1 : TPTP v8.1.2. Released v1.0.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n005.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 2400
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon Oct 2 12:55:01 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 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 --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.HzaMGqiVfr/E---3.1_4314.p
% 0.22/0.51 # Version: 3.1pre001
% 0.22/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.51 # Starting sh5l with 300s (1) cores
% 0.22/0.51 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 4467 completed with status 0
% 0.22/0.51 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.22/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.51 # No SInE strategy applied
% 0.22/0.51 # Search class: FUUPM-FFSF22-MFFFFFNN
% 0.22/0.51 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.51 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 0.22/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.22/0.51 # Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.22/0.51 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.22/0.51 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 136s (1) cores
% 0.22/0.51 # G-E--_300_C01_F1_SE_CS_SP_S0Y with pid 4479 completed with status 0
% 0.22/0.51 # Result found by G-E--_300_C01_F1_SE_CS_SP_S0Y
% 0.22/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.51 # No SInE strategy applied
% 0.22/0.51 # Search class: FUUPM-FFSF22-MFFFFFNN
% 0.22/0.51 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.51 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 0.22/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.22/0.51 # Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.22/0.51 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.22/0.51 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 136s (1) cores
% 0.22/0.51 # Preprocessing time : 0.001 s
% 0.22/0.51
% 0.22/0.51 # Proof found!
% 0.22/0.51 # SZS status Unsatisfiable
% 0.22/0.51 # SZS output start CNFRefutation
% See solution above
% 0.22/0.51 # Parsed axioms : 14
% 0.22/0.51 # Removed by relevancy pruning/SinE : 0
% 0.22/0.51 # Initial clauses : 14
% 0.22/0.51 # Removed in clause preprocessing : 2
% 0.22/0.51 # Initial clauses in saturation : 12
% 0.22/0.51 # Processed clauses : 20
% 0.22/0.51 # ...of these trivial : 4
% 0.22/0.51 # ...subsumed : 0
% 0.22/0.51 # ...remaining for further processing : 16
% 0.22/0.51 # Other redundant clauses eliminated : 0
% 0.22/0.51 # Clauses deleted for lack of memory : 0
% 0.22/0.51 # Backward-subsumed : 0
% 0.22/0.51 # Backward-rewritten : 3
% 0.22/0.51 # Generated clauses : 39
% 0.22/0.51 # ...of the previous two non-redundant : 17
% 0.22/0.51 # ...aggressively subsumed : 0
% 0.22/0.51 # Contextual simplify-reflections : 0
% 0.22/0.51 # Paramodulations : 39
% 0.22/0.51 # Factorizations : 0
% 0.22/0.51 # NegExts : 0
% 0.22/0.51 # Equation resolutions : 0
% 0.22/0.51 # Total rewrite steps : 32
% 0.22/0.51 # Propositional unsat checks : 0
% 0.22/0.51 # Propositional check models : 0
% 0.22/0.51 # Propositional check unsatisfiable : 0
% 0.22/0.51 # Propositional clauses : 0
% 0.22/0.51 # Propositional clauses after purity: 0
% 0.22/0.51 # Propositional unsat core size : 0
% 0.22/0.51 # Propositional preprocessing time : 0.000
% 0.22/0.51 # Propositional encoding time : 0.000
% 0.22/0.51 # Propositional solver time : 0.000
% 0.22/0.51 # Success case prop preproc time : 0.000
% 0.22/0.51 # Success case prop encoding time : 0.000
% 0.22/0.51 # Success case prop solver time : 0.000
% 0.22/0.51 # Current number of processed clauses : 13
% 0.22/0.51 # Positive orientable unit clauses : 11
% 0.22/0.51 # Positive unorientable unit clauses: 2
% 0.22/0.51 # Negative unit clauses : 0
% 0.22/0.51 # Non-unit-clauses : 0
% 0.22/0.51 # Current number of unprocessed clauses: 9
% 0.22/0.51 # ...number of literals in the above : 9
% 0.22/0.51 # Current number of archived formulas : 0
% 0.22/0.51 # Current number of archived clauses : 5
% 0.22/0.51 # Clause-clause subsumption calls (NU) : 0
% 0.22/0.51 # Rec. Clause-clause subsumption calls : 0
% 0.22/0.51 # Non-unit clause-clause subsumptions : 0
% 0.22/0.51 # Unit Clause-clause subsumption calls : 0
% 0.22/0.51 # Rewrite failures with RHS unbound : 0
% 0.22/0.51 # BW rewrite match attempts : 17
% 0.22/0.51 # BW rewrite match successes : 15
% 0.22/0.51 # Condensation attempts : 0
% 0.22/0.51 # Condensation successes : 0
% 0.22/0.51 # Termbank termtop insertions : 410
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.003 s
% 0.22/0.51 # System time : 0.002 s
% 0.22/0.51 # Total time : 0.005 s
% 0.22/0.51 # Maximum resident set size: 1572 pages
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.013 s
% 0.22/0.51 # System time : 0.010 s
% 0.22/0.51 # Total time : 0.023 s
% 0.22/0.51 # Maximum resident set size: 1676 pages
% 0.22/0.51 % E---3.1 exiting
% 0.22/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------