%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : HWV001-1 : TPTP v8.1.0. Released v1.1.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 : n018.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 : Sat Jul 16 14:10:26 EDT 2022 % Result : Unsatisfiable 0.19s 0.46s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : HWV001-1 : TPTP v8.1.0. Released v1.1.0. % 0.07/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 : n018.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 16 23:16:01 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.36 # No SInE strategy applied % 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.36 # % 0.12/0.36 # Presaturation interreduction done % 0.12/0.36 # Number of axioms: 47 Number of unprocessed: 43 % 0.12/0.36 # Tableaux proof search. % 0.12/0.36 # APR header successfully linked. % 0.12/0.36 # Hello from C++ % 0.12/0.36 # The folding up rule is enabled... % 0.12/0.36 # Local unification is enabled... % 0.12/0.36 # Any saturation attempts will use folding labels... % 0.12/0.36 # 43 beginning clauses after preprocessing and clausification % 0.12/0.36 # Creating start rules for all 17 conjectures. % 0.12/0.36 # There are 17 start rule candidates: % 0.12/0.36 # Found 43 unit axioms. % 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.36 # 17 start rule tableaux created. % 0.12/0.36 # 0 extension rule candidate clauses % 0.12/0.36 # 43 unit axiom clauses % 0.12/0.36 % 0.12/0.36 # Requested 8, 32 cores available to the main process. % 0.19/0.46 # Creating equality axioms % 0.19/0.46 # Ran out of tableaux, making start rules for all clauses % 0.19/0.46 # Creating equality axioms % 0.19/0.46 # Ran out of tableaux, making start rules for all clauses % 0.19/0.46 # Creating equality axioms % 0.19/0.46 # Ran out of tableaux, making start rules for all clauses % 0.19/0.46 # Creating equality axioms % 0.19/0.46 # Ran out of tableaux, making start rules for all clauses % 0.19/0.46 # Creating equality axioms % 0.19/0.46 # Ran out of tableaux, making start rules for all clauses % 0.19/0.46 # Creating equality axioms % 0.19/0.46 # Ran out of tableaux, making start rules for all clauses % 0.19/0.46 # There were 1 total branch saturation attempts. % 0.19/0.46 # There were 0 of these attempts blocked. % 0.19/0.46 # There were 0 deferred branch saturation attempts. % 0.19/0.46 # There were 0 free duplicated saturations. % 0.19/0.46 # There were 1 total successful branch saturations. % 0.19/0.46 # There were 0 successful branch saturations in interreduction. % 0.19/0.46 # There were 0 successful branch saturations on the branch. % 0.19/0.46 # There were 1 successful branch saturations after the branch. % 0.19/0.46 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.46 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.46 # Begin clausification derivation % 0.19/0.46 % 0.19/0.46 # End clausification derivation % 0.19/0.46 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.46 cnf(i_0_85, negated_conjecture, (d3=f3)). % 0.19/0.46 cnf(i_0_80, negated_conjecture, (not(d1)=b1)). % 0.19/0.46 cnf(i_0_81, negated_conjecture, (not(d2)=b2)). % 0.19/0.46 cnf(i_0_86, negated_conjecture, (not(e1)=d1)). % 0.19/0.46 cnf(i_0_87, negated_conjecture, (not(e2)=d2)). % 0.19/0.46 cnf(i_0_90, negated_conjecture, (not(i1)=f1)). % 0.19/0.46 cnf(i_0_91, negated_conjecture, (not(i2)=f2)). % 0.19/0.46 cnf(i_0_52, plain, (not(n0)=n1)). % 0.19/0.46 cnf(i_0_53, plain, (not(n1)=n0)). % 0.19/0.46 cnf(i_0_63, plain, (and(X1,X1)=X1)). % 0.19/0.46 cnf(i_0_66, plain, (or(X1,X1)=X1)). % 0.19/0.46 cnf(i_0_82, negated_conjecture, (or(c1,c2)=b3)). % 0.19/0.46 cnf(i_0_75, plain, (not(not(X1))=X1)). % 0.19/0.46 cnf(i_0_92, negated_conjecture, (and(i1,i2)=f3)). % 0.19/0.46 cnf(i_0_49, plain, (and(X1,n1)=X1)). % 0.19/0.46 cnf(i_0_50, plain, (or(X1,n0)=X1)). % 0.19/0.46 cnf(i_0_48, plain, (and(X1,n0)=n0)). % 0.19/0.46 cnf(i_0_93, negated_conjecture, (circuit(input(i1,i2),output(a1,a2)))). % 0.19/0.46 cnf(i_0_51, plain, (or(X1,n1)=n1)). % 0.19/0.46 cnf(i_0_69, plain, (and(X1,not(X1))=n0)). % 0.19/0.46 cnf(i_0_72, plain, (or(X1,not(X1))=n1)). % 0.19/0.46 cnf(i_0_64, plain, (and(X1,and(X2,X1))=and(X2,X1))). % 0.19/0.46 cnf(i_0_65, plain, (and(X1,and(X1,X2))=and(X1,X2))). % 0.19/0.46 cnf(i_0_67, plain, (or(X1,or(X2,X1))=or(X2,X1))). % 0.19/0.46 cnf(i_0_78, negated_conjecture, (and(b3,b1)=a1)). % 0.19/0.46 cnf(i_0_79, negated_conjecture, (and(b3,b2)=a2)). % 0.19/0.46 cnf(i_0_83, negated_conjecture, (or(f3,d1)=c1)). % 0.19/0.46 cnf(i_0_84, negated_conjecture, (or(f3,d2)=c2)). % 0.19/0.46 cnf(i_0_88, negated_conjecture, (or(f3,f1)=e1)). % 0.19/0.46 cnf(i_0_89, negated_conjecture, (or(f3,f2)=e2)). % 0.19/0.46 cnf(i_0_68, plain, (or(X1,or(X1,X2))=or(X1,X2))). % 0.19/0.46 cnf(i_0_60, plain, (or(not(X1),not(X2))=not(and(X1,X2)))). % 0.19/0.46 cnf(i_0_61, plain, (and(not(X1),not(X2))=not(or(X1,X2)))). % 0.19/0.46 cnf(i_0_77, plain, (or(and(X1,X2),and(X2,not(X1)))=X2)). % 0.19/0.46 cnf(i_0_76, plain, (or(and(X1,X2),and(X1,not(X2)))=X1)). % 0.19/0.46 cnf(i_0_56, plain, (and(and(X1,X2),X3)=and(X1,and(X2,X3)))). % 0.19/0.46 cnf(i_0_71, plain, (and(X1,and(X2,not(X1)))=n0)). % 0.19/0.46 cnf(i_0_57, plain, (or(or(X1,X2),X3)=or(X1,or(X2,X3)))). % 0.19/0.46 cnf(i_0_62, plain, (or(and(X1,X2),and(X3,X2))=and(or(X1,X3),X2))). % 0.19/0.46 cnf(i_0_74, plain, (or(X1,or(X2,not(X1)))=n1)). % 0.19/0.46 cnf(i_0_54, plain, (and(X1,X2)=and(X2,X1))). % 0.19/0.46 cnf(i_0_55, plain, (or(X1,X2)=or(X2,X1))). % 0.19/0.46 cnf(i_0_94, negated_conjecture, (~circuit(input(i1,i2),output(i2,i1)))). % 0.19/0.46 cnf(i_0_112, plain, (X4=X4)). % 0.19/0.46 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.46 # Begin printing tableau % 0.19/0.46 # Found 6 steps % 0.19/0.46 cnf(i_0_112, plain, (f3=f3), inference(start_rule)). % 0.19/0.46 cnf(i_0_165, plain, (f3=f3), inference(extension_rule, [i_0_116])). % 0.19/0.46 cnf(i_0_175, plain, (d3!=f3), inference(closure_rule, [i_0_85])). % 0.19/0.46 cnf(i_0_173, plain, (and(f3,d3)=and(f3,f3)), inference(extension_rule, [i_0_115])). % 0.19/0.46 cnf(i_0_182, plain, (and(f3,f3)!=f3), inference(closure_rule, [i_0_63])). % 0.19/0.46 cnf(i_0_180, plain, (and(f3,d3)=f3), inference(etableau_closure_rule, [i_0_180, ...])). % 0.19/0.46 # End printing tableau % 0.19/0.46 # SZS output end % 0.19/0.46 # Branches closed with saturation will be marked with an "s" % 0.19/0.47 # Child (20949) has found a proof. % 0.19/0.47 % 0.19/0.47 # Proof search is over... % 0.19/0.47 # Freeing feature tree %------------------------------------------------------------------------------