%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LAT268-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 : n020.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 04:49:54 EDT 2022 % Result : Unsatisfiable 0.19s 0.36s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.11 % Problem : LAT268-2 : TPTP v8.1.0. Released v3.2.0. % 0.12/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.33 % Computer : n020.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Wed Jun 29 00:20:31 EDT 2022 % 0.12/0.33 % CPUTime : % 0.19/0.36 # No SInE strategy applied % 0.19/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.19/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.19/0.36 # % 0.19/0.36 # Presaturation interreduction done % 0.19/0.36 # Number of axioms: 10 Number of unprocessed: 10 % 0.19/0.36 # Tableaux proof search. % 0.19/0.36 # APR header successfully linked. % 0.19/0.36 # Hello from C++ % 0.19/0.36 # The folding up rule is enabled... % 0.19/0.36 # Local unification is enabled... % 0.19/0.36 # Any saturation attempts will use folding labels... % 0.19/0.36 # 10 beginning clauses after preprocessing and clausification % 0.19/0.36 # Creating start rules for all 3 conjectures. % 0.19/0.36 # There are 3 start rule candidates: % 0.19/0.36 # Found 8 unit axioms. % 0.19/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.19/0.36 # 3 start rule tableaux created. % 0.19/0.36 # 2 extension rule candidate clauses % 0.19/0.36 # 8 unit axiom clauses % 0.19/0.36 % 0.19/0.36 # Requested 8, 32 cores available to the main process. % 0.19/0.36 # There are not enough tableaux to fork, creating more from the initial 3 % 0.19/0.36 # There were 2 total branch saturation attempts. % 0.19/0.36 # There were 0 of these attempts blocked. % 0.19/0.36 # There were 0 deferred branch saturation attempts. % 0.19/0.36 # There were 0 free duplicated saturations. % 0.19/0.36 # There were 2 total successful branch saturations. % 0.19/0.36 # There were 2 successful branch saturations in interreduction. % 0.19/0.36 # There were 0 successful branch saturations on the branch. % 0.19/0.36 # There were 0 successful branch saturations after the branch. % 0.19/0.36 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.36 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.36 # Begin clausification derivation % 0.19/0.36 % 0.19/0.36 # End clausification derivation % 0.19/0.36 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.36 cnf(i_0_13, negated_conjecture, (c_in(v_x,v_S,t_a))). % 0.19/0.36 cnf(i_0_12, negated_conjecture, (c_lessequals(v_S,v_A,tc_set(t_a)))). % 0.19/0.36 cnf(i_0_15, plain, (c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit)=v_A)). % 0.19/0.36 cnf(i_0_22, plain, (c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit)=v_r)). % 0.19/0.36 cnf(i_0_18, plain, (c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)))). % 0.19/0.36 cnf(i_0_19, plain, (c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)))). % 0.19/0.36 cnf(i_0_21, plain, (c_Tarski_Opotype_Opset(c_Tarski_Odual(X1,X2),X2,tc_Product__Type_Ounit)=c_Tarski_Opotype_Opset(X1,X2,tc_Product__Type_Ounit))). % 0.19/0.36 cnf(i_0_14, negated_conjecture, (~c_in(c_Pair(c_Tarski_Olub(v_S,c_Tarski_Odual(v_cl,t_a),t_a),v_x,t_a,t_a),v_r,tc_prod(t_a,t_a)))). % 0.19/0.36 cnf(i_0_17, plain, (c_in(c_Pair(X1,X2,X3,X3),c_Tarski_Opotype_Oorder(X4,X3,tc_Product__Type_Ounit),tc_prod(X3,X3))|~c_in(c_Pair(X2,X1,X3,X3),c_Tarski_Opotype_Oorder(c_Tarski_Odual(X4,X3),X3,tc_Product__Type_Ounit),tc_prod(X3,X3)))). % 0.19/0.36 cnf(i_0_16, plain, (c_in(c_Pair(X1,c_Tarski_Olub(X2,X3,X4),X4,X4),c_Tarski_Opotype_Oorder(X3,X4,tc_Product__Type_Ounit),tc_prod(X4,X4))|~c_in(X3,c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(X4,tc_Product__Type_Ounit))|~c_in(X3,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(X4,tc_Product__Type_Ounit))|~c_in(X1,X2,X4)|~c_lessequals(X2,c_Tarski_Opotype_Opset(X3,X4,tc_Product__Type_Ounit),tc_set(X4)))). % 0.19/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.36 # Begin printing tableau % 0.19/0.36 # Found 7 steps % 0.19/0.36 cnf(i_0_13, negated_conjecture, (c_in(v_x,v_S,t_a)), inference(start_rule)). % 0.19/0.36 cnf(i_0_25, plain, (c_in(v_x,v_S,t_a)), inference(extension_rule, [i_0_16])). % 0.19/0.36 cnf(i_0_43, plain, (~c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit))), inference(closure_rule, [i_0_18])). % 0.19/0.36 cnf(i_0_44, plain, (~c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit))), inference(closure_rule, [i_0_19])). % 0.19/0.36 cnf(i_0_42, plain, (c_in(c_Pair(v_x,c_Tarski_Olub(v_S,c_Tarski_Odual(v_cl,t_a),t_a),t_a,t_a),c_Tarski_Opotype_Oorder(c_Tarski_Odual(v_cl,t_a),t_a,tc_Product__Type_Ounit),tc_prod(t_a,t_a))), inference(extension_rule, [i_0_17])). % 0.19/0.36 cnf(i_0_46, plain, (~c_lessequals(v_S,c_Tarski_Opotype_Opset(c_Tarski_Odual(v_cl,t_a),t_a,tc_Product__Type_Ounit),tc_set(t_a))), inference(etableau_closure_rule, [i_0_46, ...])). % 0.19/0.36 cnf(i_0_47, plain, (c_in(c_Pair(c_Tarski_Olub(v_S,c_Tarski_Odual(v_cl,t_a),t_a),v_x,t_a,t_a),c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit),tc_prod(t_a,t_a))), inference(etableau_closure_rule, [i_0_47, ...])). % 0.19/0.36 # End printing tableau % 0.19/0.36 # SZS output end % 0.19/0.36 # Branches closed with saturation will be marked with an "s" % 0.19/0.36 # Returning from population with 1 new_tableaux and 0 remaining starting tableaux. % 0.19/0.36 # We now have 1 tableaux to operate on % 0.19/0.36 # Found closed tableau during pool population. % 0.19/0.36 # Proof search is over... % 0.19/0.36 # Freeing feature tree %------------------------------------------------------------------------------