TSTP Solution File: LCL445-2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL445-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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:24:55 EDT 2023
% Result : Unsatisfiable 0.15s 0.42s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 17 ( 11 unt; 0 nHn; 15 RR)
% Number of literals : 26 ( 0 equ; 11 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-3 aty)
% Number of variables : 32 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_PropLog_Othms_OMP_0,axiom,
( c_in(X4,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(X1,X4,X3),c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
file('/export/starexec/sandbox/tmp/tmp.lQyUQNjGwM/E---3.1_19016.p',cls_PropLog_Othms_OMP_0) ).
cnf(cls_PropLog_Othms__excluded__middle_0,axiom,
c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(X1,X2,X3),c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(X1,c_PropLog_Opl_Ofalse,X3),X2,X3),X2,X3),X3),c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3)),
file('/export/starexec/sandbox/tmp/tmp.lQyUQNjGwM/E---3.1_19016.p',cls_PropLog_Othms__excluded__middle_0) ).
cnf(cls_PropLog_Odeduction_0,axiom,
( c_in(c_PropLog_Opl_Oop_A_N_62(X2,X1,X4),c_PropLog_Othms(X3,X4),tc_PropLog_Opl(X4))
| ~ c_in(X1,c_PropLog_Othms(c_insert(X2,X3,tc_PropLog_Opl(X4)),X4),tc_PropLog_Opl(X4)) ),
file('/export/starexec/sandbox/tmp/tmp.lQyUQNjGwM/E---3.1_19016.p',cls_PropLog_Odeduction_0) ).
cnf(cls_conjecture_1,negated_conjecture,
c_in(v_q,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(v_p,c_PropLog_Opl_Ofalse,t_a),v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
file('/export/starexec/sandbox/tmp/tmp.lQyUQNjGwM/E---3.1_19016.p',cls_conjecture_1) ).
cnf(cls_conjecture_0,negated_conjecture,
c_in(v_q,c_PropLog_Othms(c_insert(v_p,v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
file('/export/starexec/sandbox/tmp/tmp.lQyUQNjGwM/E---3.1_19016.p',cls_conjecture_0) ).
cnf(cls_conjecture_2,negated_conjecture,
~ c_in(v_q,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
file('/export/starexec/sandbox/tmp/tmp.lQyUQNjGwM/E---3.1_19016.p',cls_conjecture_2) ).
cnf(c_0_6,axiom,
( c_in(X4,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(X1,X4,X3),c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
cls_PropLog_Othms_OMP_0 ).
cnf(c_0_7,axiom,
c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(X1,X2,X3),c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(X1,c_PropLog_Opl_Ofalse,X3),X2,X3),X2,X3),X3),c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3)),
cls_PropLog_Othms__excluded__middle_0 ).
cnf(c_0_8,plain,
( c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(X1,c_PropLog_Opl_Ofalse,X2),X3,X2),X3,X2),c_PropLog_Othms(X4,X2),tc_PropLog_Opl(X2))
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(X1,X3,X2),c_PropLog_Othms(X4,X2),tc_PropLog_Opl(X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,axiom,
( c_in(c_PropLog_Opl_Oop_A_N_62(X2,X1,X4),c_PropLog_Othms(X3,X4),tc_PropLog_Opl(X4))
| ~ c_in(X1,c_PropLog_Othms(c_insert(X2,X3,tc_PropLog_Opl(X4)),X4),tc_PropLog_Opl(X4)) ),
cls_PropLog_Odeduction_0 ).
cnf(c_0_10,negated_conjecture,
c_in(v_q,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(v_p,c_PropLog_Opl_Ofalse,t_a),v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
cls_conjecture_1 ).
cnf(c_0_11,negated_conjecture,
c_in(v_q,c_PropLog_Othms(c_insert(v_p,v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
cls_conjecture_0 ).
cnf(c_0_12,plain,
( c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(X4,c_PropLog_Opl_Ofalse,X3),X1,X3),c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(X4,X1,X3),c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_13,negated_conjecture,
c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_p,c_PropLog_Opl_Ofalse,t_a),v_q,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_q,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
inference(spm,[status(thm)],[c_0_9,c_0_11]) ).
cnf(c_0_15,negated_conjecture,
~ c_in(v_q,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
cls_conjecture_2 ).
cnf(c_0_16,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.09 % Problem : LCL445-2 : TPTP v8.1.2. Released v3.2.0.
% 0.09/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n010.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 2400
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Mon Oct 2 11:38:35 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.15/0.41 Running first-order model finding
% 0.15/0.41 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.lQyUQNjGwM/E---3.1_19016.p
% 0.15/0.42 # Version: 3.1pre001
% 0.15/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.42 # Starting sh5l with 300s (1) cores
% 0.15/0.42 # new_bool_1 with pid 19096 completed with status 0
% 0.15/0.42 # Result found by new_bool_1
% 0.15/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.42 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.42 # Search class: FHUNF-FFSF32-MFFFFFNN
% 0.15/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.42 # SAT001_MinMin_p005000_rr_RG with pid 19101 completed with status 0
% 0.15/0.42 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.15/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.42 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.42 # Search class: FHUNF-FFSF32-MFFFFFNN
% 0.15/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.42 # Preprocessing time : 0.001 s
% 0.15/0.42 # Presaturation interreduction done
% 0.15/0.42
% 0.15/0.42 # Proof found!
% 0.15/0.42 # SZS status Unsatisfiable
% 0.15/0.42 # SZS output start CNFRefutation
% See solution above
% 0.15/0.42 # Parsed axioms : 6
% 0.15/0.42 # Removed by relevancy pruning/SinE : 0
% 0.15/0.42 # Initial clauses : 6
% 0.15/0.42 # Removed in clause preprocessing : 0
% 0.15/0.42 # Initial clauses in saturation : 6
% 0.15/0.42 # Processed clauses : 19
% 0.15/0.42 # ...of these trivial : 0
% 0.15/0.42 # ...subsumed : 0
% 0.15/0.42 # ...remaining for further processing : 19
% 0.15/0.42 # Other redundant clauses eliminated : 0
% 0.15/0.42 # Clauses deleted for lack of memory : 0
% 0.15/0.42 # Backward-subsumed : 0
% 0.15/0.42 # Backward-rewritten : 0
% 0.15/0.42 # Generated clauses : 14
% 0.15/0.42 # ...of the previous two non-redundant : 10
% 0.15/0.42 # ...aggressively subsumed : 0
% 0.15/0.42 # Contextual simplify-reflections : 0
% 0.15/0.42 # Paramodulations : 14
% 0.15/0.42 # Factorizations : 0
% 0.15/0.42 # NegExts : 0
% 0.15/0.42 # Equation resolutions : 0
% 0.15/0.42 # Total rewrite steps : 4
% 0.15/0.42 # Propositional unsat checks : 0
% 0.15/0.42 # Propositional check models : 0
% 0.15/0.42 # Propositional check unsatisfiable : 0
% 0.15/0.42 # Propositional clauses : 0
% 0.15/0.42 # Propositional clauses after purity: 0
% 0.15/0.42 # Propositional unsat core size : 0
% 0.15/0.42 # Propositional preprocessing time : 0.000
% 0.15/0.42 # Propositional encoding time : 0.000
% 0.15/0.42 # Propositional solver time : 0.000
% 0.15/0.42 # Success case prop preproc time : 0.000
% 0.15/0.42 # Success case prop encoding time : 0.000
% 0.15/0.42 # Success case prop solver time : 0.000
% 0.15/0.42 # Current number of processed clauses : 13
% 0.15/0.42 # Positive orientable unit clauses : 6
% 0.15/0.42 # Positive unorientable unit clauses: 0
% 0.15/0.42 # Negative unit clauses : 3
% 0.15/0.42 # Non-unit-clauses : 4
% 0.15/0.42 # Current number of unprocessed clauses: 2
% 0.15/0.42 # ...number of literals in the above : 3
% 0.15/0.42 # Current number of archived formulas : 0
% 0.15/0.42 # Current number of archived clauses : 6
% 0.15/0.42 # Clause-clause subsumption calls (NU) : 2
% 0.15/0.42 # Rec. Clause-clause subsumption calls : 1
% 0.15/0.42 # Non-unit clause-clause subsumptions : 0
% 0.15/0.42 # Unit Clause-clause subsumption calls : 1
% 0.15/0.42 # Rewrite failures with RHS unbound : 0
% 0.15/0.42 # BW rewrite match attempts : 3
% 0.15/0.42 # BW rewrite match successes : 0
% 0.15/0.42 # Condensation attempts : 0
% 0.15/0.42 # Condensation successes : 0
% 0.15/0.42 # Termbank termtop insertions : 585
% 0.15/0.42
% 0.15/0.42 # -------------------------------------------------
% 0.15/0.42 # User time : 0.001 s
% 0.15/0.42 # System time : 0.003 s
% 0.15/0.42 # Total time : 0.004 s
% 0.15/0.42 # Maximum resident set size: 1644 pages
% 0.15/0.42
% 0.15/0.42 # -------------------------------------------------
% 0.15/0.42 # User time : 0.003 s
% 0.15/0.42 # System time : 0.003 s
% 0.15/0.42 # Total time : 0.006 s
% 0.15/0.42 # Maximum resident set size: 1680 pages
% 0.15/0.42 % E---3.1 exiting
%------------------------------------------------------------------------------