TSTP Solution File: NUN088+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : NUN088+1 : TPTP v8.1.0. Released v7.3.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 : n029.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 : Mon Jul 18 16:26:23 EDT 2022
% Result : Theorem 0.19s 0.37s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUN088+1 : TPTP v8.1.0. Released v7.3.0.
% 0.03/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 : n029.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 : Thu Jun 2 03:32:01 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.37 # No SInE strategy applied
% 0.19/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.19/0.37 #
% 0.19/0.37 # Presaturation interreduction done
% 0.19/0.37 # Number of axioms: 46 Number of unprocessed: 46
% 0.19/0.37 # Tableaux proof search.
% 0.19/0.37 # APR header successfully linked.
% 0.19/0.37 # Hello from C++
% 0.19/0.37 # The folding up rule is enabled...
% 0.19/0.37 # Local unification is enabled...
% 0.19/0.37 # Any saturation attempts will use folding labels...
% 0.19/0.37 # 46 beginning clauses after preprocessing and clausification
% 0.19/0.37 # Creating start rules for all 4 conjectures.
% 0.19/0.37 # There are 4 start rule candidates:
% 0.19/0.37 # Found 22 unit axioms.
% 0.19/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.19/0.37 # 4 start rule tableaux created.
% 0.19/0.37 # 24 extension rule candidate clauses
% 0.19/0.37 # 22 unit axiom clauses
% 0.19/0.37
% 0.19/0.37 # Requested 8, 32 cores available to the main process.
% 0.19/0.37 # There are not enough tableaux to fork, creating more from the initial 4
% 0.19/0.37 # Closed tableau found in foldup close cycle with 0 folds and 2 closures done.
% 0.19/0.37 # There were 0 total branch saturation attempts.
% 0.19/0.37 # There were 0 of these attempts blocked.
% 0.19/0.37 # There were 0 deferred branch saturation attempts.
% 0.19/0.37 # There were 0 free duplicated saturations.
% 0.19/0.37 # There were 0 total successful branch saturations.
% 0.19/0.37 # There were 0 successful branch saturations in interreduction.
% 0.19/0.37 # There were 0 successful branch saturations on the branch.
% 0.19/0.37 # There were 0 successful branch saturations after the branch.
% 0.19/0.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.37 # Begin clausification derivation
% 0.19/0.37
% 0.19/0.37 # End clausification derivation
% 0.19/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.37 cnf(i_0_61, negated_conjecture, (r1(esk22_0))).
% 0.19/0.37 cnf(i_0_60, negated_conjecture, (r1(esk23_0))).
% 0.19/0.37 cnf(i_0_62, negated_conjecture, (id(esk22_0,esk21_0))).
% 0.19/0.37 cnf(i_0_59, negated_conjecture, (r2(esk23_0,esk21_0))).
% 0.19/0.37 cnf(i_0_48, plain, (r1(esk14_1(X1)))).
% 0.19/0.37 cnf(i_0_53, plain, (r1(esk16_1(X1)))).
% 0.19/0.37 cnf(i_0_17, plain, (id(X1,X1))).
% 0.19/0.37 cnf(i_0_50, plain, (r1(esk17_1(X1)))).
% 0.19/0.37 cnf(i_0_49, plain, (id(esk13_1(X1),X1))).
% 0.19/0.37 cnf(i_0_51, plain, (id(esk15_1(X1),esk17_1(X1)))).
% 0.19/0.37 cnf(i_0_39, plain, (r2(X1,esk7_2(X2,X1)))).
% 0.19/0.37 cnf(i_0_44, plain, (r2(X1,esk11_2(X2,X1)))).
% 0.19/0.37 cnf(i_0_47, plain, (r3(X1,esk14_1(X1),esk13_1(X1)))).
% 0.19/0.37 cnf(i_0_52, plain, (r4(X1,esk16_1(X1),esk15_1(X1)))).
% 0.19/0.37 cnf(i_0_36, plain, (r3(X1,X2,esk8_2(X1,X2)))).
% 0.19/0.37 cnf(i_0_41, plain, (r4(X1,X2,esk12_2(X1,X2)))).
% 0.19/0.37 cnf(i_0_40, plain, (id(esk6_2(X1,X2),esk5_2(X1,X2)))).
% 0.19/0.37 cnf(i_0_45, plain, (id(esk10_2(X1,X2),esk9_2(X1,X2)))).
% 0.19/0.37 cnf(i_0_37, plain, (r2(esk8_2(X1,X2),esk5_2(X1,X2)))).
% 0.19/0.37 cnf(i_0_38, plain, (r3(X1,esk7_2(X1,X2),esk6_2(X1,X2)))).
% 0.19/0.37 cnf(i_0_43, plain, (r4(X1,esk11_2(X1,X2),esk10_2(X1,X2)))).
% 0.19/0.37 cnf(i_0_42, plain, (r3(esk12_2(X1,X2),X1,esk9_2(X1,X2)))).
% 0.19/0.37 cnf(i_0_1, plain, (r1(X1)|~id(X1,esk1_0))).
% 0.19/0.37 cnf(i_0_4, plain, (id(X1,esk1_0)|~r1(X1))).
% 0.19/0.37 cnf(i_0_58, plain, (~r2(X1,X2)|~r1(X3)|~id(X3,X2))).
% 0.19/0.37 cnf(i_0_22, plain, (r1(X1)|~r1(X2)|~id(X2,X1))).
% 0.19/0.37 cnf(i_0_21, plain, (r1(X1)|~r1(X2)|~id(X1,X2))).
% 0.19/0.37 cnf(i_0_5, plain, (r2(X1,X2)|~id(X2,esk2_1(X1)))).
% 0.19/0.37 cnf(i_0_18, plain, (id(X1,X2)|~id(X2,X1))).
% 0.19/0.37 cnf(i_0_9, plain, (r3(X1,X2,X3)|~id(X3,esk3_2(X1,X2)))).
% 0.19/0.37 cnf(i_0_13, plain, (r4(X1,X2,X3)|~id(X3,esk4_2(X1,X2)))).
% 0.19/0.37 cnf(i_0_8, plain, (id(X1,esk2_1(X2))|~r2(X2,X1))).
% 0.19/0.37 cnf(i_0_19, plain, (id(X1,X2)|~id(X3,X2)|~id(X1,X3))).
% 0.19/0.37 cnf(i_0_57, plain, (id(X1,esk20_1(X1))|id(X1,esk18_1(X1)))).
% 0.19/0.37 cnf(i_0_55, plain, (r1(esk18_1(X1))|id(X1,esk20_1(X1)))).
% 0.19/0.37 cnf(i_0_54, plain, (r2(esk19_1(X1),esk20_1(X1))|r1(esk18_1(X1)))).
% 0.19/0.37 cnf(i_0_56, plain, (r2(esk19_1(X1),esk20_1(X1))|id(X1,esk18_1(X1)))).
% 0.19/0.37 cnf(i_0_12, plain, (id(X1,esk3_2(X2,X3))|~r3(X2,X3,X1))).
% 0.19/0.37 cnf(i_0_16, plain, (id(X1,esk4_2(X2,X3))|~r4(X2,X3,X1))).
% 0.19/0.37 cnf(i_0_46, plain, (id(X1,X2)|~r2(X2,X3)|~r2(X1,X4)|~id(X4,X3))).
% 0.19/0.37 cnf(i_0_26, plain, (r2(X1,X2)|~r2(X3,X4)|~id(X4,X2)|~id(X3,X1))).
% 0.19/0.37 cnf(i_0_25, plain, (r2(X1,X2)|~r2(X3,X4)|~id(X2,X4)|~id(X1,X3))).
% 0.19/0.37 cnf(i_0_30, plain, (r3(X1,X2,X3)|~r3(X4,X5,X6)|~id(X6,X3)|~id(X5,X2)|~id(X4,X1))).
% 0.19/0.37 cnf(i_0_29, plain, (r3(X1,X2,X3)|~r3(X4,X5,X6)|~id(X3,X6)|~id(X2,X5)|~id(X1,X4))).
% 0.19/0.37 cnf(i_0_34, plain, (r4(X1,X2,X3)|~r4(X4,X5,X6)|~id(X6,X3)|~id(X5,X2)|~id(X4,X1))).
% 0.19/0.37 cnf(i_0_33, plain, (r4(X1,X2,X3)|~r4(X4,X5,X6)|~id(X3,X6)|~id(X2,X5)|~id(X1,X4))).
% 0.19/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.37 # Begin printing tableau
% 0.19/0.37 # Found 4 steps
% 0.19/0.37 cnf(i_0_62, negated_conjecture, (id(esk22_0,esk21_0)), inference(start_rule)).
% 0.19/0.37 cnf(i_0_64, plain, (id(esk22_0,esk21_0)), inference(extension_rule, [i_0_58])).
% 0.19/0.37 cnf(i_0_141, plain, (~r2(esk23_0,esk21_0)), inference(closure_rule, [i_0_59])).
% 0.19/0.37 cnf(i_0_142, plain, (~r1(esk22_0)), inference(closure_rule, [i_0_61])).
% 0.19/0.37 # End printing tableau
% 0.19/0.37 # SZS output end
% 0.19/0.37 # Branches closed with saturation will be marked with an "s"
% 0.19/0.37 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux.
% 0.19/0.37 # We now have 9 tableaux to operate on
% 0.19/0.37 # Found closed tableau during pool population.
% 0.19/0.37 # Proof search is over...
% 0.19/0.37 # Freeing feature tree
%------------------------------------------------------------------------------