TSTP Solution File: HWC002-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : HWC002-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:51:06 EDT 2023
% Result : Unsatisfiable 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of clauses : 36 ( 36 unt; 0 nHn; 19 RR)
% Number of literals : 36 ( 29 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-4 aty)
% Number of variables : 40 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(empty_table,axiom,
table(n0,n0,n0,n0) = nil,
file('/export/starexec/sandbox/tmp/tmp.0n7KD1g7e7/E---3.1_23279.p',empty_table) ).
cnf(not_definition2,axiom,
not(n1) = n0,
file('/export/starexec/sandbox/tmp/tmp.0n7KD1g7e7/E---3.1_23279.p',not_definition2) ).
cnf(full_table,axiom,
table(n1,n1,n1,n1) = nil,
file('/export/starexec/sandbox/tmp/tmp.0n7KD1g7e7/E---3.1_23279.p',full_table) ).
cnf(or_definition5,axiom,
or(nil,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.0n7KD1g7e7/E---3.1_23279.p',or_definition5) ).
cnf(or_table_definition,axiom,
or(table(X1,X2,X3,X4),table(X5,X6,X7,X8)) = table(or(X1,X5),or(X2,X6),or(X3,X7),or(X4,X8)),
file('/export/starexec/sandbox/tmp/tmp.0n7KD1g7e7/E---3.1_23279.p',or_table_definition) ).
cnf(or_definition4,axiom,
or(n1,n1) = n1,
file('/export/starexec/sandbox/tmp/tmp.0n7KD1g7e7/E---3.1_23279.p',or_definition4) ).
cnf(prove_output_configuration,negated_conjecture,
~ circuit(top(connect(table(n0,n1,n0,n1),nil)),nil,bottom(connect(table(n0,n0,n1,n1),nil))),
file('/export/starexec/sandbox/tmp/tmp.0n7KD1g7e7/E---3.1_23279.p',prove_output_configuration) ).
cnf(or_definition3,axiom,
or(n1,n0) = n1,
file('/export/starexec/sandbox/tmp/tmp.0n7KD1g7e7/E---3.1_23279.p',or_definition3) ).
cnf(connect_definition1,axiom,
connect(nil,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.0n7KD1g7e7/E---3.1_23279.p',connect_definition1) ).
cnf(subsume_symmetric,axiom,
circuit(top(X1),X2,bottom(X1)),
file('/export/starexec/sandbox/tmp/tmp.0n7KD1g7e7/E---3.1_23279.p',subsume_symmetric) ).
cnf(c_0_10,axiom,
table(n0,n0,n0,n0) = nil,
empty_table ).
cnf(c_0_11,axiom,
not(n1) = n0,
not_definition2 ).
cnf(c_0_12,axiom,
table(n1,n1,n1,n1) = nil,
full_table ).
cnf(c_0_13,plain,
nil = table(not(n1),not(n1),not(n1),not(n1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_11]),c_0_11]),c_0_11]) ).
cnf(c_0_14,axiom,
or(nil,X1) = X1,
or_definition5 ).
cnf(c_0_15,plain,
table(not(n1),not(n1),not(n1),not(n1)) = table(n1,n1,n1,n1),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,axiom,
or(table(X1,X2,X3,X4),table(X5,X6,X7,X8)) = table(or(X1,X5),or(X2,X6),or(X3,X7),or(X4,X8)),
or_table_definition ).
cnf(c_0_17,plain,
or(table(n1,n1,n1,n1),X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_13]),c_0_15]) ).
cnf(c_0_18,plain,
table(or(n1,X1),or(n1,X2),or(n1,X3),or(n1,X4)) = table(X1,X2,X3,X4),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,axiom,
or(n1,n1) = n1,
or_definition4 ).
cnf(c_0_20,plain,
table(or(n1,X1),or(n1,X2),or(n1,X3),n1) = table(X1,X2,X3,n1),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,negated_conjecture,
~ circuit(top(connect(table(n0,n1,n0,n1),nil)),nil,bottom(connect(table(n0,n0,n1,n1),nil))),
prove_output_configuration ).
cnf(c_0_22,axiom,
or(n1,n0) = n1,
or_definition3 ).
cnf(c_0_23,plain,
table(or(n1,X1),or(n1,X2),n1,n1) = table(X1,X2,n1,n1),
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_24,negated_conjecture,
~ circuit(top(connect(table(not(n1),n1,not(n1),n1),nil)),nil,bottom(connect(table(not(n1),not(n1),n1,n1),nil))),
inference(spm,[status(thm)],[c_0_21,c_0_11]) ).
cnf(c_0_25,plain,
or(n1,not(n1)) = n1,
inference(rw,[status(thm)],[c_0_22,c_0_11]) ).
cnf(c_0_26,plain,
table(or(n1,X1),n1,n1,n1) = table(X1,n1,n1,n1),
inference(spm,[status(thm)],[c_0_23,c_0_19]) ).
cnf(c_0_27,plain,
table(or(n1,X1),n1,or(n1,X2),n1) = table(X1,n1,X2,n1),
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_28,axiom,
connect(nil,X1) = X1,
connect_definition1 ).
cnf(c_0_29,negated_conjecture,
~ circuit(top(connect(table(not(n1),n1,not(n1),n1),table(n1,n1,n1,n1))),table(n1,n1,n1,n1),bottom(connect(table(not(n1),not(n1),n1,n1),table(n1,n1,n1,n1)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_13]),c_0_13]),c_0_13]),c_0_15]),c_0_15]),c_0_15]) ).
cnf(c_0_30,plain,
table(X1,not(n1),n1,n1) = table(X1,n1,n1,n1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_25]),c_0_26]) ).
cnf(c_0_31,plain,
table(X1,n1,not(n1),n1) = table(X1,n1,n1,n1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_25]),c_0_26]) ).
cnf(c_0_32,plain,
table(not(n1),n1,n1,n1) = table(n1,n1,n1,n1),
inference(spm,[status(thm)],[c_0_26,c_0_25]) ).
cnf(c_0_33,plain,
connect(table(n1,n1,n1,n1),X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_13]),c_0_15]) ).
cnf(c_0_34,axiom,
circuit(top(X1),X2,bottom(X1)),
subsume_symmetric ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_32]),c_0_33]),c_0_32]),c_0_33]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : HWC002-1 : TPTP v8.1.2. Released v1.1.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n011.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 : Tue Oct 3 00:29:38 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.21/0.49 Running first-order model finding
% 0.21/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.0n7KD1g7e7/E---3.1_23279.p
% 0.21/0.50 # Version: 3.1pre001
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # new_bool_1 with pid 23377 completed with status 0
% 0.21/0.50 # Result found by new_bool_1
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.50 # Search class: FHUSM-FFMM31-MFFFFFNN
% 0.21/0.50 # partial match(1): FHUSM-FFMF31-MFFFFFNN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting H----_042_B03_F1_AE_Q4_SP_S2S with 181s (1) cores
% 0.21/0.50 # H----_042_B03_F1_AE_Q4_SP_S2S with pid 23386 completed with status 0
% 0.21/0.50 # Result found by H----_042_B03_F1_AE_Q4_SP_S2S
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.50 # Search class: FHUSM-FFMM31-MFFFFFNN
% 0.21/0.50 # partial match(1): FHUSM-FFMF31-MFFFFFNN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting H----_042_B03_F1_AE_Q4_SP_S2S with 181s (1) cores
% 0.21/0.50 # Preprocessing time : 0.001 s
% 0.21/0.50
% 0.21/0.50 # Proof found!
% 0.21/0.50 # SZS status Unsatisfiable
% 0.21/0.50 # SZS output start CNFRefutation
% See solution above
% 0.21/0.50 # Parsed axioms : 38
% 0.21/0.50 # Removed by relevancy pruning/SinE : 0
% 0.21/0.50 # Initial clauses : 38
% 0.21/0.50 # Removed in clause preprocessing : 0
% 0.21/0.50 # Initial clauses in saturation : 38
% 0.21/0.50 # Processed clauses : 61
% 0.21/0.50 # ...of these trivial : 4
% 0.21/0.50 # ...subsumed : 1
% 0.21/0.50 # ...remaining for further processing : 56
% 0.21/0.50 # Other redundant clauses eliminated : 0
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 0
% 0.21/0.50 # Backward-rewritten : 10
% 0.21/0.50 # Generated clauses : 181
% 0.21/0.50 # ...of the previous two non-redundant : 161
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 0
% 0.21/0.50 # Paramodulations : 181
% 0.21/0.50 # Factorizations : 0
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 0
% 0.21/0.50 # Total rewrite steps : 311
% 0.21/0.50 # Propositional unsat checks : 0
% 0.21/0.50 # Propositional check models : 0
% 0.21/0.50 # Propositional check unsatisfiable : 0
% 0.21/0.50 # Propositional clauses : 0
% 0.21/0.50 # Propositional clauses after purity: 0
% 0.21/0.50 # Propositional unsat core size : 0
% 0.21/0.50 # Propositional preprocessing time : 0.000
% 0.21/0.50 # Propositional encoding time : 0.000
% 0.21/0.50 # Propositional solver time : 0.000
% 0.21/0.50 # Success case prop preproc time : 0.000
% 0.21/0.50 # Success case prop encoding time : 0.000
% 0.21/0.50 # Success case prop solver time : 0.000
% 0.21/0.50 # Current number of processed clauses : 46
% 0.21/0.50 # Positive orientable unit clauses : 41
% 0.21/0.50 # Positive unorientable unit clauses: 0
% 0.21/0.50 # Negative unit clauses : 2
% 0.21/0.50 # Non-unit-clauses : 3
% 0.21/0.50 # Current number of unprocessed clauses: 137
% 0.21/0.50 # ...number of literals in the above : 157
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 10
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 0
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 0
% 0.21/0.50 # Non-unit clause-clause subsumptions : 0
% 0.21/0.50 # Unit Clause-clause subsumption calls : 1
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 45
% 0.21/0.50 # BW rewrite match successes : 5
% 0.21/0.50 # Condensation attempts : 0
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 4939
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.007 s
% 0.21/0.50 # System time : 0.002 s
% 0.21/0.50 # Total time : 0.009 s
% 0.21/0.50 # Maximum resident set size: 1792 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.009 s
% 0.21/0.50 # System time : 0.004 s
% 0.21/0.50 # Total time : 0.013 s
% 0.21/0.50 # Maximum resident set size: 1732 pages
% 0.21/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------