TSTP Solution File: LCL446-2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LCL446-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% Computer : n009.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 : 300s
% WCLimit : 600s
% DateTime : Sun Jul 17 10:22:21 EDT 2022
% Result : Unsatisfiable 0.07s 0.27s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : LCL446-2 : TPTP v8.1.0. Released v3.2.0.
% 0.00/0.07 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.07/0.25 % Computer : n009.cluster.edu
% 0.07/0.25 % Model : x86_64 x86_64
% 0.07/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.25 % Memory : 8042.1875MB
% 0.07/0.25 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.25 % CPULimit : 300
% 0.07/0.25 % WCLimit : 600
% 0.07/0.25 % DateTime : Mon Jul 4 12:15:52 EDT 2022
% 0.07/0.26 % CPUTime :
% 0.07/0.27 # No SInE strategy applied
% 0.07/0.27 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.07/0.27 # and selection function SelectCQIPrecWNTNp.
% 0.07/0.27 #
% 0.07/0.27 # Presaturation interreduction done
% 0.07/0.27 # Number of axioms: 4 Number of unprocessed: 4
% 0.07/0.27 # Tableaux proof search.
% 0.07/0.27 # APR header successfully linked.
% 0.07/0.27 # Hello from C++
% 0.07/0.27 # The folding up rule is enabled...
% 0.07/0.27 # Local unification is enabled...
% 0.07/0.27 # Any saturation attempts will use folding labels...
% 0.07/0.27 # 4 beginning clauses after preprocessing and clausification
% 0.07/0.27 # Creating start rules for all 1 conjectures.
% 0.07/0.27 # There are 1 start rule candidates:
% 0.07/0.27 # Found 3 unit axioms.
% 0.07/0.27 # 1 start rule tableaux created.
% 0.07/0.27 # 1 extension rule candidate clauses
% 0.07/0.27 # 3 unit axiom clauses
% 0.07/0.27
% 0.07/0.27 # Requested 8, 32 cores available to the main process.
% 0.07/0.27 # There are not enough tableaux to fork, creating more from the initial 1
% 0.07/0.27 # There were 1 total branch saturation attempts.
% 0.07/0.27 # There were 0 of these attempts blocked.
% 0.07/0.27 # There were 0 deferred branch saturation attempts.
% 0.07/0.27 # There were 0 free duplicated saturations.
% 0.07/0.27 # There were 1 total successful branch saturations.
% 0.07/0.27 # There were 0 successful branch saturations in interreduction.
% 0.07/0.27 # There were 0 successful branch saturations on the branch.
% 0.07/0.27 # There were 1 successful branch saturations after the branch.
% 0.07/0.27 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.27 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.27 # Begin clausification derivation
% 0.07/0.27
% 0.07/0.27 # End clausification derivation
% 0.07/0.27 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.07/0.27 cnf(i_0_6, plain, (c_in(c_PropLog_Opl_Oop_A_N_62(X1,c_PropLog_Opl_Oop_A_N_62(X2,X1,X3),X3),c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3)))).
% 0.07/0.27 cnf(i_0_8, plain, (c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(X1,c_PropLog_Opl_Oop_A_N_62(X2,X3,X4),X4),c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(X1,X2,X4),c_PropLog_Opl_Oop_A_N_62(X1,X3,X4),X4),X4),c_PropLog_Othms(X5,X4),tc_PropLog_Opl(X4)))).
% 0.07/0.27 cnf(i_0_5, negated_conjecture, (~c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_p,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)))).
% 0.07/0.27 cnf(i_0_7, plain, (c_in(X1,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))|~c_in(X4,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)))).
% 0.07/0.27 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.07/0.27 # Begin printing tableau
% 0.07/0.27 # Found 6 steps
% 0.07/0.27 cnf(i_0_5, negated_conjecture, (~c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_p,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a))), inference(start_rule)).
% 0.07/0.27 cnf(i_0_9, plain, (~c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_p,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a))), inference(extension_rule, [i_0_7])).
% 0.07/0.27 cnf(i_0_11, plain, (~c_in(c_PropLog_Opl_Oop_A_N_62(v_p,c_PropLog_Opl_Oop_A_N_62(v_p,v_p,t_a),t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a))), inference(closure_rule, [i_0_6])).
% 0.07/0.27 cnf(i_0_12, plain, (~c_in(v_p,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a))), inference(extension_rule, [i_0_7])).
% 0.07/0.27 cnf(i_0_15, plain, (~c_in(c_PropLog_Opl_Oop_A_N_62(X1,c_PropLog_Opl_Oop_A_N_62(X2,X1,t_a),t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a))), inference(closure_rule, [i_0_6])).
% 0.07/0.27 cnf(i_0_14, plain, (~c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(X1,c_PropLog_Opl_Oop_A_N_62(X2,X1,t_a),t_a),v_p,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a))), inference(etableau_closure_rule, [i_0_14, ...])).
% 0.07/0.27 # End printing tableau
% 0.07/0.27 # SZS output end
% 0.07/0.27 # Branches closed with saturation will be marked with an "s"
% 0.07/0.27 # Returning from population with 1 new_tableaux and 0 remaining starting tableaux.
% 0.07/0.27 # We now have 1 tableaux to operate on
% 0.07/0.27 # Found closed tableau during pool population.
% 0.07/0.27 # Proof search is over...
% 0.07/0.27 # Freeing feature tree
%------------------------------------------------------------------------------